Parallel selection of fifth generation (5g) new radio information

ABSTRACT

Apparatuses, systems, and techniques to select fifth-generation (5G) new radio data. In at least one embodiment, a processor includes one or more circuits to select 5G new radio signal information in parallel.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to Greek Patent Application No. 20210100648, filed Sep. 30, 2021, entitled “PARALLEL SELECTION OF FIFTH GENERATION (5G) NEW RADIO INFORMATION,” the disclosure of which is herein incorporated by reference in its entirety.

FIELD

At least one embodiment pertains to selecting radio signal information for fifth generation (5G) radio signals. For example, at least one embodiment pertains to determining, in parallel, a receiver rate based on a transmission rate.

BACKGROUND

Performing computational operations for radio signal transmission can introduce significant lag when performed sequentially. An amount of lag introduced by performing computational operations sequentially can be reduced by computational operations for radio signal transmission in parallel.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example data transmission service, according to at least one embodiment;

FIG. 2 illustrates an example data transmission rate matching method selection, according to at least one embodiment;

FIG. 3 illustrates an example process for selecting bits in data transmission rate matching, according to at least one embodiment;

FIG. 4 illustrates an example data transmission rate matching data flow, according to at least one embodiment;

FIG. 5 illustrates an example process for encoding data blocks in data transmission rate matching, according to at least one embodiment;

FIG. 6 illustrates an example process for data transmission rate matching, according to at least one embodiment;

FIG. 7 illustrates an example encoded data block processing data flow for data transmission rate matching, according to at least one embodiment;

FIG. 8 illustrates an example bit selection data flow data for data transmission rate matching, according to at least one embodiment;

FIG. 9 illustrates an example process for sequentially selecting bits in data transmission rate matching, according to at least one embodiment;

FIG. 10 illustrates an example thread assignment diagram for processing data blocks in data transmission rate matching, according to at least one embodiment;

FIG. 11 illustrates an example data retransmission diagram for processing data blocks in data transmission rate matching, according to at least one embodiment;

FIG. 12 illustrates an example process for retransmitting data blocks in data transmission rate matching, according to at least one embodiment;

FIG. 13 illustrates an example process for selecting bits in data transmission rate matching in parallel, according to at least one embodiment;

FIG. 14 illustrates an example data center system, according to at least one embodiment;

FIG. 15A illustrates an example of an autonomous vehicle, according to at least one embodiment;

FIG. 15B illustrates an example of camera locations and fields of view for the autonomous vehicle of FIG. 15A, according to at least one embodiment;

FIG. 15C is a block diagram illustrating an example system architecture for the autonomous vehicle of FIG. 15A, according to at least one embodiment;

FIG. 15D is a diagram illustrating a system for communication between cloud-based server(s) and the autonomous vehicle of FIG. 15A, according to at least one embodiment;

FIG. 16 is a block diagram illustrating a computer system, according to at least one embodiment;

FIG. 17 is a block diagram illustrating computer system, according to at least one embodiment;

FIG. 18 illustrates a computer system, according to at least one embodiment;

FIG. 19 illustrates a computer system, according at least one embodiment;

FIG. 20A illustrates a computer system, according to at least one embodiment;

FIG. 20B illustrates a computer system, according to at least one embodiment;

FIG. 20C illustrates a computer system, according to at least one embodiment;

FIG. 20D illustrates a computer system, according to at least one embodiment;

FIGS. 20E and 20F illustrate a shared programming model, according to at least one embodiment;

FIG. 21 illustrates exemplary integrated circuits and associated graphics processors, according to at least one embodiment;

FIGS. 22A and 22B illustrate exemplary integrated circuits and associated graphics processors, according to at least one embodiment;

FIGS. 23A and 23B illustrate additional exemplary graphics processor logic according to at least one embodiment;

FIG. 24 illustrates a computer system, according to at least one embodiment;

FIG. 25A illustrates a parallel processor, according to at least one embodiment;

FIG. 25B illustrates a partition unit, according to at least one embodiment;

FIG. 25C illustrates a processing cluster, according to at least one embodiment;

FIG. 25D illustrates a graphics multiprocessor, according to at least one embodiment;

FIG. 26 illustrates a multi-graphics processing unit (GPU) system, according to at least one embodiment;

FIG. 27 illustrates a graphics processor, according to at least one embodiment;

FIG. 28 is a block diagram illustrating a processor micro-architecture for a processor, according to at least one embodiment;

FIG. 29 illustrates at least portions of a graphics processor, according to one or more embodiments;

FIG. 30 illustrates at least portions of a graphics processor, according to one or more embodiments;

FIG. 31 illustrates at least portions of a graphics processor, according to one or more embodiments;

FIG. 32 is a block diagram of a graphics processing engine of a graphics processor in accordance with at least one embodiment;

FIG. 33 is a block diagram of at least portions of a graphics processor core, according to at least one embodiment;

FIGS. 34A and 34B illustrate thread execution logic including an array of processing elements of a graphics processor core according to at least one embodiment;

FIG. 35 illustrates a parallel processing unit (“PPU”), according to at least one embodiment;

FIG. 36 illustrates a general processing cluster (“GPC”), according to at least one embodiment;

FIG. 37 illustrates a memory partition unit of a parallel processing unit (“PPU”), according to at least one embodiment;

FIG. 38 illustrates a streaming multi-processor, according to at least one embodiment;

FIG. 39 illustrates a network for communicating data within a 5G wireless communications network, according to at least one embodiment;

FIG. 40 illustrates a network architecture for a 5G LTE wireless network, according to at least one embodiment;

FIG. 41 is a diagram illustrating some basic functionality of a mobile telecommunications network/system operating in accordance with LTE and 5G principles, according to at least one embodiment;

FIG. 42 illustrates a radio access network which may be part of a 5G network architecture, according to at least one embodiment;

FIG. 43 provides an example illustration of a 5G mobile communications system in which a plurality of different types of devices is used, according to at least one embodiment;

FIG. 44 illustrates an example high level system, according to at least one embodiment;

FIG. 45 illustrates an architecture of a system of a network, according to at least one embodiment;

FIG. 46 illustrates example components of a device, according to at least one embodiment;

FIG. 47 illustrates example interfaces of baseband circuitry, according to at least one embodiment;

FIG. 48 illustrates an example of an uplink channel, according to at least one embodiment;

FIG. 49 illustrates an architecture of a system of a network, according to at least one embodiment;

FIG. 50 illustrates a control plane protocol stack, according to at least one embodiment;

FIG. 51 illustrates a user plane protocol stack, according to at least one embodiment;

FIG. 52 illustrates components of a core network, according to at least one embodiment; and

FIG. 53 illustrates components of a system to support network function virtualization (NFV), according to at least one embodiment.

DETAILED DESCRIPTION

FIG. 1 illustrates an example data transmission service 100, according to at least one embodiment. In at least one embodiment, data transmission resources 102 of a network (such as network 3900, radio access network (RAN) 4004, core network 4102, RAN 4200, a mobile communications network as illustrated in FIG. 43 , or another network such as those described herein) are available for transmission of network data, using systems and methods such as those described herein. In at least one embodiment, data transmission resources 102 are shared resources and at least a portion of data transmission resources 102 are used resources 104, which may be used by other data 108. In at least one embodiment, other data 108 may be Third Generation (3G), Fourth Generation (4G), and/or Long-Term Evolution (LTE) data from 3G, 4G, and/or LTE data transmitted using systems and methods such as those described herein. In at least one embodiment, other data 108 may be transmitted using a wireless transceiver such as wireless transceiver 2926. In at least one embodiment, data transmission resources 102 may be used to broadcast, or multicast, or narrowcast, data using systems and methods such as those described herein.

In at least one embodiment, data transmission resources 102 may be used to transmit Fifth Generation (5G) data. In at least one embodiment, available resources 102 of data transmission resources 102 are resources that are not used resources 104. In at least one embodiment, at least a portion of available resources 106 may be used to transmit 5G data 110. In at least one embodiment, data transmission resources 102 are shared between other data 108 and 5G data 110. In at least one embodiment, data transmission resources 102 that are shared between other data 108 and 5G data 110 include one or more wireless spectra, which may be used by hardware such as that described herein (i.e., base stations, devices, etc.). In at least one embodiment, an air interface such as air interface in radio access network 4200 may use and share one or more wireless spectra, as described herein. In at least one embodiment, one or more wireless spectra of data transmission resources 102 may be dynamically shared so that, when a 5G transmission occurs, an amount and bandwidth of spectra usable as available resources 106 for 5G data 110 may be based at least in part on spectra and bandwidth consumed as used resources 104 for other data 108. In at least one embodiment, dynamic spectrum sharing (DSS) is enabled by a process, not illustrated in FIG. 1 , whereby an amount and bandwidth of spectra usable as available resources 106 for 5G data 110 is dynamically calculated based at least in part on spectra and bandwidth consumed as used resources 104 for other data 108 when a 5G transmission occurs. In at least one embodiment, in DSS, an amount and bandwidth of spectra usable as available resources 106 for 5G data 110 is continuously calculated based at least in part on spectra and bandwidth consumed as used resources 104 for other data 108 so that, for example, an amount and bandwidth of spectra usable as available resources 106 for 5G data 110 is continuously available.

In at least one embodiment, DSS calculations determine a 5G transmission rate 112 that may be used to transmit 5G data 110, based at least in part on available resources 106. In at least one embodiment, 5G transmission rate 112 includes a bit rate in bits-per-second, kilobits-per-second, megabits-per-second, et cetera. In at least one embodiment, 5G transmission rate 112 includes a frequency in hertz, kilohertz, megahertz, gigahertz, et cetera. In at least one embodiment, 5G transmission rate 112 includes a determined portion of one or more spectra of data transmission resources 102 that may be shared by used resources 104 and available resources 106.

In at least one embodiment, as described herein, an amount and bandwidth of spectra usable as available resources 106 for 5G data 110 is dynamically and/or continuously calculated and 5G transmission rate 112 may be dynamically and/or continuously updated based at least in part on updated calculations of an amount and bandwidth of spectra usable as available resources 106 for 5G data 110. In at least one embodiment, a rate matching 114 process is used to analyze transmission of 5G data 110 to determine 5G transmission rate 112. In at least one embodiment, rate matching 114 may use one or more processes such as example process 500, example process 600, example process 900, example process 1200, and/or example process 1300, described herein.

In at least one embodiment, a processor 124 performs rate matching 114. In at least one embodiment, processor 124 may store calculations and/or results of rate matching 114 processes using memory 126. In at least one embodiment, processor 124 may be a central processing unit (CPU), or may be a graphics processing unit (GPU), or may be a parallel processing unit (PPU), or may be a texture processing unit (TPU), or may be a general-purpose graphics processing unit (GPGPU), or may be a general processing cluster (GPC). In at least one embodiment, processor 124 may be processor 1510, CPU 1516, GPU 1520, processor 1602, CPU 1506, GPU 1508, one or more of CPU 1580(A-B), one or more of GPU 1584(A-H), processor 1710, CPU 1802, PPU 1814, processing unit 1930, multi-core processor 2005 and/or 2006, GPU 2010, GPU 2011, GPU 2012, and/or GPU 2013, processor 2002, processor 2007, application processor 2105, graphics processor 2110, image processor 2115, video processor 2120, graphics processor 2210, graphics processor 2240, graphics processor 2300, GPGPU 2330, parallel processor 2412, processor 2402, parallel processing unit 2502, graphics multiprocessor 2534, GPGPU 2606(A-D), processor 2602, graphics processor 2700, processor 2800, processor 2902, graphics processor 2908, processor 3000, graphics processor 3008, graphics processor 3100, PPU 3500, GPC 3600, streaming multiprocessor 3800, or processors such as those described herein.

In at least one embodiment, memory 126 may be memory associated with a CPU, a GPU, a PPU, a TPU, a GPGPU, and/or a GPC. In at least one embodiment, memory 126 may be memory 1620, main memory 1804, processor memory 2001, processor memory 2002, GPU memory 2020-2023, memory 2165, cache/shared memory 2320, memory 2344A-B, system memory 2404, parallel processing memory 2522, shared memory 2570, cache memory 2572, embedded memory module 3018, shared memory/cache memory 3312, memory 3504, or other memory such as that described herein.

In at least one embodiment, processor 124 has included thereon, instructions that, when executed, perform rate matching 114. In at least one embodiment, instructions that, when executed, perform rate matching 114 are loaded from memory 126. In at least one embodiment, instructions that, when executed, perform rate matching 114 are loaded from a computer system such as computer system 1600. In at least one embodiment, instructions for processor 124 that, when executed, perform rate matching 114, are stored in memory 126. In at least one embodiment, instructions that, when executed, perform rate matching 114, are executed by a process, processor, thread, thread group, or some other such entity that has access to memory 126. In at least one embodiment, instructions for a process, processor, thread, thread group, or some other such entity that, when executed, perform rate matching 114, are stored in memory 126. In at least one embodiment, when instructions are executed that perform rate matching 114, data associated with rate matching 114 is generated, including, but not limited to, data blocks, padded data blocks, encoded data blocks, sparsely placed data blocks, and/or circular buffer representations of data blocks. In at least one embodiment, data associated with rate matching 114 is stored in other memory associated with processor 124 including, for example, an external storage device associated with processor 124 such as those described herein.

In at least one embodiment, rate matching 114 may be used to determine a matched 5G rate 116. In at least one embodiment, rate matching 114 may be performed using elements of a graphics processing engine 3210. In at least one embodiment, rate matching 114 may be performed using elements of a graphics processor core 3300. In at least one embodiment, rate matching 114 may be performed using thread execution logic 3400. In at least one embodiment, matched 5G rate may be used by a receiver so that available resources 120 of data reception resources 118 may use matched 5G rate 116 to receive and process received 5G data 122 using systems and methods such as those described herein.

In at least one embodiment, processor 124 includes one or more circuits to cause fifth generation (5G) new radio signal information to be selected in parallel. In at least one embodiment, processor 102 has included thereon, instructions that, when executed, cause fifth generation (5G) new radio signal information to be selected in parallel.

FIG. 2 illustrates an example data transmission rate matching method selection 200, according to at least one embodiment. In at least one embodiment, as illustrated in first rate matching algorithm 202, second rate matching algorithm 204, and third rate matching algorithm 206, an initial index (K₀), an index (K_(d)) for a beginning of a null region of length F, and a bit array of length N are provided where F is less than N. In at least one embodiment, a 5G standard denotes N as Ncb, and defines Ncb as an N value (i.e., an array length) for a selected code block. In at least one embodiment, N refers to an N value (i.e., an array length) for a code block.

In at least one embodiment, first rate matching algorithm 202 may be selected when initial index K₀ is at or before index K_(d) (i.e., when K_(d)>=K₀). In at least one embodiment, first rate matching algorithm 202 may be selected when initial index K₀ is before index K_(d) (i.e., when K_(d)>v K₀). In at least one embodiment, first rate matching algorithm 202 may select bits from K₀ to K_(d), skip bits in a null region of length F, select bits after a null region to length N, and wraparound to a beginning of a bit array to select bits from a beginning of a bit array to K₀, as described in connection with step 308 of example process 300, illustrated in FIG. 3 . In at least one embodiment, first rate matching algorithm 202 may select bits from K₀ to K_(d), skip bits in a null region of length F, select bits after a null region to length N, and not wraparound to a beginning of a bit array to select bits from a beginning of a bit array to K₀, as described in connection with step 308 of example process 300, illustrated in FIG. 3 . In at least one embodiment, first rate matching algorithm 202 may select bits from K₀ to K_(d), skip bits in a null region of length F, select bits after a null region to length N, and wraparound multiple times to a beginning of a bit array to select bits from a beginning of a bit array to K₀, as described in connection with step 308 of example process 300, illustrated in FIG. 3 . In at least one embodiment, first rate matching algorithm 202 may select a predetermined number of bits by selecting a number of bits from K₀ to K_(d), skipping bits in a null region of length F, selecting bits after a null region to length N, and doing a wraparound as necessary (i.e., one or more times) to a beginning of a bit array to select bits from a beginning of a bit array to K₀, as described in connection with step 308 of example process 300, illustrated in FIG. 3 .

In at least one embodiment, second rate matching algorithm 204 may be selected when initial index K₀ is at or after a null region of length F (i.e., when K₀>=(K_(d)+F)). In at least one embodiment, second rate matching algorithm 204 may be selected when initial index K₀ is at a null region of length F (i.e., when K₀>(K_(d)+F)). In at least one embodiment, second rate matching algorithm 204 may select bits from K₀ to length N, wraparound to a beginning of a bit array to select bits from a beginning of a bit array to K_(d), skip bits in a null regions of length F, and select bits after null region to K₀, as described in connection with step 312 of example process 300, illustrated in FIG. 3 . In at least one embodiment, second rate matching algorithm 204 may select bits from K₀ to length N, not wraparound to a beginning of a bit array to select bits from a beginning of a bit array to K_(d), skip bits in a null regions of length F, and select bits after null region to K₀, as described in connection with step 312 of example process 300, illustrated in FIG. 3 . In at least one embodiment, second rate matching algorithm 204 may select bits from K₀ to length N, wraparound multiple times to a beginning of a bit array to select bits from a beginning of a bit array to K_(d), skip bits in a null regions of length F, and select bits after null region to K₀, as described in connection with step 312 of example process 300, illustrated in FIG. 3 . In at least one embodiment, second rate matching algorithm 204 may select a predetermined number of bits by selecting a number of bits from K₀ to length N, doing a wraparound as necessary (i.e., one or more times) to a beginning of a bit array to select bits from a beginning of a bit array to K_(d), skipping bits in a null regions of length F, and selecting bits after null region to K₀, as described in connection with step 312 of example process 300, illustrated in FIG. 3 .

In at least one embodiment, third rate matching algorithm 206 may be selected when initial index K₀ is within a null region of length F (i.e., when K₀<=(K_(d)+F) and K₀>=K_(d)). In at least one embodiment, third rate matching algorithm 206 may be selected when initial index K₀ is fully within a null region of length F (i.e., when K₀<(K_(d)+F) and K₀>K_(d)). In at least one embodiment, third rate matching algorithm 206 may skip bits from K₀ to (K_(d)+F), select bits from (K_(d)+F) to length N, wraparound to select bits from 0 to K_(d), and skip bits from K_(d) to K₀, as described in connection with step 316 of example process 300, illustrated in FIG. 3 . In at least one embodiment, third rate matching algorithm 206 may skip bits from K₀ to (K_(d)+F), select bits from (K_(d)+F) to length N, not wraparound to select bits from 0 to K_(d), and skip bits from K_(d) to K₀, as described in connection with step 316 of example process 300, illustrated in FIG. 3 . In at least one embodiment, third rate matching algorithm 206 may skip bits from K₀ to (K_(d)+F), select bits from (K_(d)+F) to length N, wraparound multiple times to select bits from 0 to K_(d), and skip bits from K_(d) to K₀, as described in connection with step 316 of example process 300, illustrated in FIG. 3 . In at least one embodiment, third rate matching algorithm 206 select a predetermined number of bits by skipping bits from K₀ to (K_(d)+F), selecting bits from (K_(d)+F) to length N, doing a wraparound as necessary (i.e., one or more times) to select bits from 0 to K_(d), and skipping bits from K_(d) to K₀, as described in connection with step 316 of example process 300, illustrated in FIG. 3 . In at least one embodiment, third rate matching algorithm 206 may stop after selecting bits from 0 to K_(d) (i.e., may not skip bits from K_(d) to K₀) after a wraparound, if needed.

In at least one embodiment, a null region of length F wraps around a bit array of length N when, for example, an index (K_(d)) for a beginning of a null region of length F is less than F bits from index N−1. In at least one embodiment, fourth rate matching algorithm 208 (which can be first rate matching algorithm 202 with wraparound) may be selected when initial index K₀ is at or before index K_(d) (i.e., when K_(d)>=K₀), where index K_(d) is F1 bits from index N−1, and where F=F₁+F₂. In at least one embodiment, fourth rate matching algorithm 210 may select bits from K₀ to K_(d), skip F₁ bits from K_(d) to N−1 at an end of bit array of length N, wraparound to skip F2 bits from 0 to F₂ at a beginning of bit array of length N, and select bits after a null region of length F₂ to K₀.

In at least one embodiment, not illustrated in FIG. 2 , second rate matching algorithm 204 may be performed when an index (K_(d)) for a beginning of a null region of length F is less than F bits from index N−1 and where initial index K₀ is at or after a null region of length F₂ at a beginning of a bit array (i.e., when K₀>=F₂).

In at least one embodiment, not illustrated in FIG. 2 , third rate matching algorithm 206 may be performed when an index (K_(d)) for a beginning of a null region of length F is less than F bits from index N−1 and where initial index K₀ is within a null region of length F (i.e., either when K₀ is between K_(d) and N−1 or when K₀ is between 0 and F₂).

FIG. 3 illustrates an example process 300 for selecting bits in data transmission rate matching, according to at least one embodiment. In at least one embodiment, a processor such as processor 124 executes instructions to perform example process 300. In at least one embodiment, at step 302 of example process 300, one or more data blocks are received. In at least one embodiment, one or more received data blocks are data blocks generated for rate matching, using systems and methods such as those described herein. In at least one embodiment, after step 302, execution of example process 300 advances to step 304.

In at least one embodiment, at step 304 of example process 300, one or more factors associated with rate matching are determined. In at least one embodiment, an initial index K₀ is determined. In at least one embodiment, an initial index K₀ is determined according to one or more 5G standards. In at least one embodiment, one or more other factors usable for rate matching are determined. In at least one embodiment, processes for rate matching described herein are used for an uplink (i.e., a transmission). In at least one embodiment, processes for rate matching described herein are used for a downlink (i.e., a reception). In at least one embodiment, processes for rate matching used for a downlink are also referred to as processes for derate matching. In at least one embodiment, an uplink process may perform steps that conform to steps for a downlink process. In at least one embodiment, after step 304, execution of example process 300 advances to step 306.

In at least one embodiment, at step 306 of example process 300, it is determined whether initial index K₀ is at or before a beginning of a null region of a bit array, as illustrated in FIG. 2 . In at least one embodiment, at step 306, it is determined whether initial index K₀ is at or before a beginning of a null region of a bit array by comparing initial index K₀ to an index K_(d) for a beginning of a null region of a bit array. In at least one embodiment, if at step 306, it is determined that initial index K₀ is at or before a beginning of a null region of a bit array (“YES” branch), execution of example process 300 advances to step 308. In at least one embodiment, if at step 306, it is determined that initial index K₀ is at or before a beginning of a null region of a bit array (“NO” branch), execution of example process 300 advances to step 310.

In at least one embodiment, at step 308 of example process 300, bit selection using first rate matching algorithm 202 is performed. In at least one embodiment, bit selection using first rate matching algorithm 202 is performed by selecting bits from K₀ to K_(d) from a bit array of length N, by selecting bits from (K_(d)+F) to N−1 from array of length N, and by selecting bits from 0 to K₀ from array of length N. In at least one embodiment, bit selection using first rate matching algorithm 202 is performed by selecting a predetermined number of bits (E), as defined by a 5G standard. In at least one embodiment, bit selection from a bit array of length N using first rate matching algorithm 202 includes a wraparound as described herein. In at least one embodiment, bit selection from a bit array of length N using first rate matching algorithm 202 includes a plurality of wraparounds as described herein. In at least one embodiment, bit selection from a bit array of length N using first rate matching algorithm 202 includes no wraparounds as described herein. In at least one embodiment, after step 308, execution of example process 300 continues at step 302 to receive more data.

In at least one embodiment, at step 310 of example process 300, it is determined whether initial index K₀ is at or after an end of a null region of a bit array, as illustrated in FIG. 2 . In at least one embodiment, at step 306, it is determined whether initial index K₀ is at or after an end of a null region of a bit array by comparing initial index K₀ to an index for an end of a null region, located at a start of a null region plus a length of a null region (K_(d)+F). In at least one embodiment, if at step 310, it is determined that initial index K₀ is at or after an end of a null region of a bit array (“YES” branch), execution of example process 300 advances to step 312. In at least one embodiment, if at step 310, it is determined that initial index K₀ is at or after an end of a null region of a bit array (“NO” branch), execution of example process 300 advances to step 314.

In at least one embodiment, at step 312 of example process 300, bit selection using second rate matching algorithm 204 is performed. In at least one embodiment, bit selection using second rate matching algorithm 204 is performed by selecting bits from K₀ to N−1 from a bit array of length N, by selecting bits from 0 to K_(d) from a bit array of length N, and by selecting bits from (K_(d)+F) to K₀ from array of length N. In at least one embodiment, bit selection using second rate matching algorithm 204 is performed by selecting a predetermined number of bits (E), as defined by a 5G standard. In at least one embodiment, bit selection from a bit array of length N using second rate matching algorithm 204 includes a wraparound as described herein. In at least one embodiment, bit selection from a bit array of length N using second rate matching algorithm 204 includes a plurality of wraparounds as described herein. In at least one embodiment, bit selection from a bit array of length N using second rate matching algorithm 204 includes no wraparounds as described herein. In at least one embodiment, after step 312, execution of example process 300 continues at step 302 to retrieve more data.

In at least one embodiment, at step 314 of example process 300, it is determined that initial index K₀ is within a null region of a bit array, as illustrated in FIG. 2 due to following a “NO” branch at step 306 (i.e., K₀ not before a null region) and a “NO” branch at step 308 (i.e., K₀ not after a null region). In at least one embodiment, after step 314, execution of example process 300 advances to step 316.

In at least one embodiment, at step 316 of example process 300, bit selection using third rate matching algorithm 206 is performed. In at least one embodiment, bit selection using third rate matching algorithm 206 is performed by selecting bits from (K_(d)+F) to N−1 from a bit array of length N and by selecting bits from 0 to K_(d) from a bit array of length N. In at least one embodiment, bit selection using third rate matching algorithm 206 is performed by selecting a predetermined number of bits (E), as defined by a 5G standard. In at least one embodiment, bit selection from a bit array of length N using third rate matching algorithm 206 includes a wraparound as described herein. In at least one embodiment, bit selection from a bit array of length N using third rate matching algorithm 206 includes a plurality of wraparounds as described herein. In at least one embodiment, bit selection from a bit array of length N using third rate matching algorithm 206 includes no wraparounds as described herein. In at least one embodiment, after step 316, execution of example process 300 continues at step 302 to retrieve more data.

FIG. 4 illustrates an example data transmission rate matching data flow 400, according to at least one embodiment. In at least one embodiment, an input sequence 402 of data is received. In at least one embodiment, input sequence 402 of data is B bits in length, with bits (b₀, b₁, b₂, . . . , b_(B−1)). In at least one embodiment, input sequence 402 is distributed 404 to one or more code blocks. In at least one embodiment, a 5G standard may specify a maximum length of a code block. In at least one embodiment, if B is less than a specified maximum length of a code block, input sequence 402 may be distributed 404 to a single code block. In at least one embodiment, if B is greater than a specified maximum length of a code block, input sequence 402 may be distributed 404 to a plurality of code blocks. In at least one embodiment, input sequence 402 may be distributed 404 evenly to a plurality of code blocks so that code blocks contain a similar number of bits from input sequence 402.

In at least one embodiment, a code block 406 is one of one or more code blocks that contain bits from input sequence 402. In at least one embodiment, for example, if input sequence 402 includes 65,536 bits and a maximum block size, as defined by a 5G standard, is 8,448 bits, code block 406 may be one of eight code blocks, where seven code blocks have 8,448 bits and an eighth code block has 6,400 bits and 2,048 null bits. In at least one embodiment, a code block with a maximum code block size may store less than a maximum code block size of bits so that encoding information such as, for example, a cyclic redundancy check (CRC) code may be computed for a code block and included therein. In at least one embodiment, a CRC code of twenty-four bits may be stored in a code block so that a code block may store 8,424 bits from an input sequence. In at least one embodiment, for example, if input sequence 402 includes 65,536 bits, a maximum code block size is 8,448 bits, and a twenty-four-bit CRC code is stored in each code block, code block 406 may be one of eight code blocks with seven code blocks that store 8,424 bits of input sequence 402 and a twenty-four-bit CRC, one code block that stored 6,568 bits of input sequence 402, a twenty-four-bit CRC, and 1856 null bits.

In at least one embodiment, for example, if input sequence 402 includes 65,536 bits and a maximum block size, as defined by a 5G standard, is 3,840 bits, code block 406 may be one of eighteen code blocks, where seventeen code blocks have 3,840 bits from input sequence 402 and an eighteenth code block has 256 bits from input sequence 402 and 3,584 null bits. In at least one embodiment, a code block with a maximum code block size may store less than a maximum code block size of bits so that encoding information such as, for example, a cyclic redundancy check (CRC) code may be computed for a code block and included therein. In at least one embodiment, a CRC code of twenty-four bits may be stored in a code block so that a code block may store 3,816 bits from an input sequence. In at least one embodiment, for example, if input sequence 402 includes 65,536 bits, a maximum code block size is 3,840 bits, and a twenty-four-bit CRC code is stored in each code block, code block 406 may be one of eighteen code blocks with seventeen code blocks that store 3,816 bits of input sequence 402 and a twenty-four-bit CRC and one code block that stores 664 bits of input sequence 402, a twenty-four-bit CRC, and 3152 null bits.

In at least one embodiment, code block 406 may be padded 408 with null values to generate a padded code block 410 that is of maximum code block size. In at least one embodiment, for example, a code block with 6,568 bits may have 1880 null values added to make 8,448 bits. In at least one embodiment, code block 406 may be padded 408 with null values to generate padded code block 410 before a CRC code is added so that a CRC code is computed using a code block with added null values. In at least one embodiment, code block 406 may be padded 408 with null values to generate padded code block 410 after a CRC code is added so that a CRC code is computed using a code block without added null values.

In at least one embodiment, padded code block 410 may be encoded 412 to generate an encoded code block 414. In at least one embodiment, padded code block 410 may be encoded 412 to generate encoded code block 414 using parameters specified in a 5G standard. In at least one embodiment, encoded code block 414 includes N bits (d₀, d₁, d₂, . . . , d_(N−1)) where N is a product of a number of factors specified in a 5G standard and bits (d₀, d₁, d₂, . . . , d_(N−1)) are selected from padded code block 410 according to a 5G standard. In at least one embodiment, N is greater than a maximum block size of padded code block 410. In at least one embodiment, bits (d₀, d₁, d₂, . . . , d_(N−1)) of encoded code block 414 are further processed for rate matching using systems and methods such as those described herein.

FIG. 5 illustrates an example process 500 for encoding data blocks in data transmission rate matching, according to at least one embodiment. In at least one embodiment, a processor such as processor 124 executes instructions to perform example process 500. In at least one embodiment, at step 502 of example process 500, an input sequence of bits (b₀, b₁, b₂, . . . , b_(B−1)) is received as described herein. In at least one embodiment, after step 502, execution of example process 500 advances to step 504.

In at least one embodiment, at step 504 of example process 500, a block size is determined. In at least one embodiment, a block size is determined based at least in part on a 5G standard. In at least one embodiment, after step 504, execution of example process 500 advances to step 506.

In at least one embodiment, at step 506 of example process 500, a number of blocks is determined based at least in part on a number of bits in an input sequence and a determined block size. In at least one embodiment, for example, if an input sequence includes 65,536 bits and a maximum block size is 8,192 bits, there may be eight code blocks. In at least one embodiment, where a code block with a maximum code block size may store less than a maximum code block size of bits so that a CRC code may be computed for a code a code block may store 8168 bits as described above. In at least one embodiment, for example, if an input sequence includes 65,536 bits, a maximum code block size is 8,192 bits, and a twenty-four-bit CRC code is stored in each code block, code block 406 may be one of nine code blocks that store either 7,281 bits (in two code blocks) or 7,282 bits (in seven code blocks) from an input sequence and also twenty-four bits for a CRC code, for a total of two code blocks of 7,305 bits and seven code blocks of 7,306 bits. In at least one embodiment, after step 506, execution of example process 500 advances to step 508.

In at least one embodiment, at step 508 of example process 500, it is determined whether one code block may be used, or a plurality of code blocks may be used. In at least one embodiment, at step 508, it is determined whether one code block may be used, or a plurality of code blocks may be used if a number of bits in an input sequence is less than a maximum code block size. In at least one embodiment, if at step 508, it is determined that one code block may be used (“YES” branch), execution of example process 500 advances to step 510. In at least one embodiment, if at step 508, it is determined that a plurality of code blocks may be used (“NO” branch), execution of example process 500 advances to step 512.

In at least one embodiment, at step 510 of example process 500, a single code block is generated that may be used to store bits from an input sequence. In at least one embodiment, after step 510, execution of example process 500 advances to step 522.

In at least one embodiment, at step 512 of example process 500, a first block of a plurality of code blocks is generated that may be used to store bits from an input sequence. In at least one embodiment, after step 512, execution of example process 500 advances to step 514.

In at least one embodiment, at step 514 of example process 500, a generated code block of a plurality of code blocks is populated with bits (c₀, c₁, c₂, . . . , c_(K-1)) from an input sequence as described herein. In at least one embodiment, after step 514, execution of example process 500 advances to step 516.

In at least one embodiment, at step 516 of example process 500, a CRC code is generated for a generated code block that is populated with bits (c₀, c₁, c₂, . . . , c_(K−1)) from an input sequence as described herein. In at least one embodiment, after step 516, execution of example process 500 advances to step 518.

In at least one embodiment, at step 518 of example process 500, a generated code block is padded with null values up to a maximum block size determined using a 5G standard. In at least one embodiment, step 518 executes before step 516. In at least one embodiment, step 518 executes after step 516. In at least one embodiment, after step 518, execution of example process 500 advances to step 520.

In at least one embodiment, at step 520 of example process 500, a single code block is encoded to produce bits (d₀, d₁, d₂, . . . , d_(N−1)) as described herein. In at least one embodiment, after step 520, execution of example process 500 advances to step 528.

In at least one embodiment, at step 522 of example process 500, a single code block is populated with bits (c₀, c₁, c₂, . . . , c_(K−1)) from an input sequence as described herein. In at least one embodiment, after step 522, execution of example process 500 advances to step 524.

In at least one embodiment, at step 524 of example process 500, a single code block is padded with null values up to a maximum block size determined using a 5G standard. In at least one embodiment, after step 524, execution of example process 500 advances to step 526.

In at least one embodiment, at step 526 of example process 500, a single code block is encoded to produce bits (d₀, d₁, d₂, . . . , d_(N−1)) as described herein. In at least one embodiment, after step 526, execution of example process 500 advances to step 530.

In at least one embodiment, at step 528 of example process 500, it is determined whether more code blocks of a plurality of code blocks may be generated. In at least one embodiment, if at step 528, it is determined that more code blocks of a plurality of code blocks may be generated (“YES” branch), execution of example process 500 continues at step 512 where a next block to process may be generated. In at least one embodiment, if at step 528, it is determined that no more code blocks of a plurality of code blocks may be generated (“NO” branch), execution of example process 500 advances to step 530.

In at least one embodiment, at step 530 of example process 500, one or more code blocks are returned for further processing using systems and methods such as those described herein. In at least one embodiment, if at step 508 it is determined that one code block may be used (“YES” branch), a single code block may be returned at step 530. In at least one embodiment, if at step 508 it is determined that more than one code block may be used (“NO” branch), a plurality of code block may be returned at step 530. In at least one embodiment, after step 530, execution of example process 500 terminates. In at least one embodiment, after step 530, execution of example process 500 restarts at step 502, with a new input sequence.

FIG. 6 illustrates an example process 600 for data transmission rate matching, according to at least one embodiment. In at least one embodiment, a processor such as processor 124 executes instructions to perform example process 600. In at least one embodiment, a processor such as processor 124 executes instructions to perform example process 600 sequentially. In at least one embodiment, a processor such as processor 124 executes instructions to perform example process 600 in parallel. In at least one embodiment, at step 602 of example process 600, one or more encoded data blocks containing bits (d₀, d₁, d₂, . . . , d_(N−1)) as described herein are received for processing. In at least one embodiment, after step 602, execution of example process 600 advances to step 604.

In at least one embodiment, at step 604 of example process 600, one or more common factors associated with rate matching are determined. In at least one embodiment, one or more common factors associated with rate matching are determined based on a 5G standard. In at least one embodiment, after step 604, execution of example process 600 advances to step 606.

In at least one embodiment, at step 606 of example process 600, a first block of one or more received blocks is selected for processing. In at least one embodiment, where one block is received, that block may be selected for processing. In at least one embodiment, where a plurality of data blocks is received, a first block selected for processing may be a first block of a plurality of encoded data blocks. In at least one embodiment, where a plurality of data blocks is received, a first block selected for processing may be a later block of a plurality of encoded data blocks. In at least one embodiment, a first block selected for processing may be selected based at least in part on a priority associated with a selected block. In at least one embodiment, after step 606, execution of example process 600 advances to step 608.

In at least one embodiment, at step 608 of example process 600, a block selected for processing may be treated as a circular buffer to enable a wraparound as described herein. In at least one embodiment, a block selected for processing may be treated as a circular buffer by using modular arithmetic for indexing during processing. In at least one embodiment, a block selected for processing may be copied to a circular buffer to enable a wraparound as described herein. In at least one embodiment, after step 610, execution of example process 600 advances to step 612.

In at least one embodiment, at step 610 of example process 600, an initial index K₀ used for selecting bits used for rate matching as described herein is determined based at least in part on a 5G standard. In at least one embodiment, a new initial index K0 is determined for each selected code block. In at least one embodiment, after step 610, execution of example process 600 advances to step 612.

In at least one embodiment, at step 612 of example process 600, a vector e_(k) is generated for a selected code block based at least in part on a 5G standard. In at least one embodiment, after step 612, execution of example process 600 advances to step 614.

In at least one embodiment, at step 614 of example process 600, a modulation order Qm is generated for a selected code block based at least in part on a 5G standard. In at least one embodiment, after step 614, execution of example process 600 advances to step 616.

In at least one embodiment, at step 616 of example process 600, a vector e_(k) is sparsely placed with bits (d₀, d₁, d₂, . . . , d_(N−1)) of a selected data block to generate an f_(k) vector based at least in part on a modulation order Qm, as defined by a 5G standard. In at least one embodiment, after step 616, execution of example process 600 advances to step 618.

In at least one embodiment, at step 618 of example process 600, it is determined whether there are more blocks to select for processing. In at least one embodiment, if at step 618, it is determined that there are more blocks to select for processing (“YES” branch), execution of example process 600 continues at step 606, where a next block may be selected. In at least one embodiment, if at step 618, it is determined that there are no more blocks to select for processing (“NO” branch), execution of example process 600 advances to step 620.

In at least one embodiment, at step 620 of example process 600, one or more f_(k) vectors are returned. In at least one embodiment, after step 620, execution of example process 600 terminates. In at least one embodiment, after step 620, execution of example process 600 restarts at step 602, with a new set of blocks.

FIG. 7 illustrates an example encoded data block processing data flow 700 for data transmission rate matching, according to at least one embodiment. In at least one embodiment, a padded code block 702 is encoded to produce an encoded code block 704, as described herein. In at least one embodiment, an encoded code block 704 may be treated as a circular buffer 706 to enable wraparound of indexing using modular arithmetic as described herein. In at least one embodiment, an encoded code block 704 may be copied to a circular buffer 706 to enable wraparound of indexing using modular arithmetic as described herein. In at least one embodiment, a data element cn₀ may be associated 708 with a first position of circular buffer 706 and a data element cn_(Kn−1) may be associated 710 with a second position of circular buffer 706 so that data elements of an encoded code block 704 may be contiguous in a circular buffer 706. In at least one embodiment, zeroed elements of an encoded code block 704 may also be contiguous in a circular buffer 706.

FIG. 8 illustrates an example bit selection data flow data 800 for data transmission rate matching, according to at least one embodiment. In at least one embodiment, an index K₀ 804 is generated based at least in part on a 5G standard using systems and methods such as those described herein. In at least one embodiment, index K₀ 804 is generated such that index K₀ 804 is within a region of null values of circular buffer 802 as described herein. In at least one embodiment, index K₀ 804 is generated such that index K₀ 804 is before a region of null values of circular buffer 802 as described herein. In at least one embodiment, index K₀ 804 is generated such that index K₀ 804 is after a region of null values of circular buffer 802 as described herein.

In at least one embodiment, an index is incremented starting at index K₀ until an index K_(i−1) 806 that is a null value, but that is a last null value before contiguous non-null values (i.e., a next value is not a null value). In at least one embodiment, a value of circular buffer 802 at index K_(i) 808 is a first non-null value, a value of circular buffer 802 at index K_(i+1) 810 is a second non-null value, and a value of circular buffer 802 at index K_(i+Kn−1) 812 is a last non-null value (i.e., a next value after index K_(i+Kn−1) is a null value).

FIG. 9 illustrates an example process 900 for sequentially selecting bits in data transmission rate matching, according to at least one embodiment. In at least one embodiment, a processor such as processor 124 executes instructions to perform example process 900. In at least one embodiment, example process 900 includes steps, not illustrated, for skipping bits as described herein. In at least one embodiment, for an uplink rate matching algorithm, bits may be placed in a buffer and one or more sequential positions within a buffer may be skipped (i.e., may have null values). In at least one embodiment, for a downlink rate matching algorithm, bits may be selected from a buffer and null values may be skipped when selecting. In at least one embodiment, at step 902 of example process 900, a circular buffer is received. In at least one embodiment, after step 902, execution of example process 900 advances to step 904.

In at least one embodiment, at step 904 of example process 900 initial index K₀ is determined based at least in part on a 5G standard, as described herein. In at least one embodiment, after step 904, execution of example process 900 advances to step 906.

In at least one embodiment, at step 906 of example process 900, an index used for locating non-null values is generated, beginning at initial index K₀. In at least one embodiment, after step 906, execution of example process 900 advances to step 908.

In at least one embodiment, at step 908 of example process 900, data at an index used for locating non-null values in a circular buffer is read. In at least one embodiment, after step 908, execution of example process 900 advances to step 910.

In at least one embodiment, at step 910 of example process 900, it is determined whether data at an index used for locating non-null values in a circular buffer is a null or zero value. In at least one embodiment, if at step 910, it is determined that data at an index used for locating non-null values in a circular buffer is a null or zero value (“YES” branch), execution of example process 900 advances to step 912. In at least one embodiment, if at step 910, it is determined that data at an index used for locating non-null values in a circular buffer is not a null or zero value (“NO” branch), execution of example process 900 advances to step 914.

In at least one embodiment, at step 912 of example process 900, an index used for locating non-null values in a circular buffer is incremented using modular arithmetic so that incrementing an index wraps around a circular buffer, as described herein. In at least one embodiment, after step 912, execution of example process 900 continues at step 908 to check data at an incremented index.

In at least one embodiment, at step 914 of example process 900, a non-null value K_(i) is located at an index used for locating non-null values in a circular buffer. In at least one embodiment, after step 914, execution of example process 900 advances to step 916.

In at least one embodiment, at step 916 of example process 900, bits are selected from a circular buffer using algorithms described herein in FIG. 3 and FIG. 4 . In at least one embodiment, after step 916, execution of example process 900 terminates.

FIG. 10 illustrates an example thread assignment diagram 1000 for processing data blocks in data transmission rate matching, according to at least one embodiment. In at least one embodiment, a stream 1002 of data blocks is received. In at least one embodiment, a data block B1 is assigned for processing using resources of thread 1004, a data block B2 is assigned for processing using resources of thread 1006, a data block B3 is assigned for processing using resources of thread 1012, and a data block B4 is assigned for processing using resources of thread 1014.

In at least one embodiment, a data block B5 may be assigned for processing using resources of thread 1004 after thread 1004 completes processing data block B1 and a data block B6 may be assigned for processing using resources of thread 1006 after thread 1006 completes processing data block B2. In at least one embodiment, processing of data block B2 by thread 1006 may result in an error 1008. In at least one embodiment, if processing of data block B2 by thread 1006 results in an error 1008, data block B2 may be returned 1010 to stream 1002 for reprocessing. In at least one embodiment, data block B2 may be assigned for reprocessing using resources of thread 1012 after thread 1012 completes processing data block B3. In at least one embodiment, a data block B7 may be assigned for processing using resources of thread 1014 after thread 1014 completes processing data block B4. In at least one embodiment, one thread may process a plurality of bits in a data block. In at least one embodiment, a plurality of threads may process a single bit in a data block. In at least one embodiment, one thread may process a single bit in a data block.

FIG. 11 illustrates an example data retransmission diagram 1100 for processing data blocks in data transmission rate matching, according to at least one embodiment. In at least one embodiment, a data retransmission diagram is illustrated as a circular queue 1102. In at least one embodiment, an order of transmission 1104 may be determined based at least in part on a 5G standard. In at least one embodiment, for example, if there are four transmissions for a data block, an order of transmission 1104 may be first, third, fourth, and second (denoted {RV0, RV2, RV3, RV1}). In at least one embodiment, a first transmission 1106 may occur at RV0. In at least one embodiment, a third transmission 1108 may occur at RV2, following first transmission 1106. In at least one embodiment, data in third transmission 1108 may be perturbed using techniques specified in a 5G standard so that data in third transmission 1108 may differ from data in first transmission 1106.

In at least one embodiment, a fourth transmission 1110 may occur at RV3, following third transmission 1108. In at least one embodiment, data in fourth transmission 1110 may also be perturbed using techniques specified in a 5G standard so that data in fourth transmission 1110 may differ from data in first transmission 1106 and so that data in fourth transmission 1110 may differ from data in third transmission 1108.

In at least one embodiment, a second transmission 1112 may occur at RV1, following fourth transmission 1110. In at least one embodiment, data in second transmission 1112 may also be perturbed using techniques specified in a 5G standard so that data in second transmission 1112 may differ from data in first transmission 1106, so that data in second transmission 1112 may differ from data in third transmission 1108, and so that data in second transmission 1112 may differ from data in fourth transmission 1110.

FIG. 12 illustrates an example process 1200 for retransmitting data blocks in data transmission rate matching, according to at least one embodiment. In at least one embodiment, a processor such as processor 124 executes instructions to perform example process 1200. In at least one embodiment, at step 1202 of example process 1200, a block of data is received for retransmission. In at least one embodiment, after step 1202, execution of example process 1200 advances to step 1204.

In at least one embodiment, at step 1204 of example process 1200, data RV0 for a first transmission of a data block is generated. In at least one embodiment, data RV0 is perturbed using techniques specified in a 5G standard so that data RV0 for a first transmission of a data block differs from data in a received block of data. In at least one embodiment, data RV0 in a data block is not perturbed so that data RV0 for a first transmission of a data block is identical to data in a received block of data. In at least one embodiment, after step 1204, execution of example process 1200 advances to step 1206.

In at least one embodiment, at step 1206 of example process 1200, data RV0 for a first transmission of a data block is transmitted. In at least one embodiment, after step 1206, execution of example process 1200 advances to step 1208.

In at least one embodiment, at step 1208 of example process 1200, it is determined whether a second transmission of data in a received data block may occur. In at least one embodiment, if at step 1208, it is determined that a second transmission of data in a received data block may occur (“YES” branch), execution of example process 1200 advances to step 1210. In at least one embodiment, if at step 1208, it is determined that a second transmission of data in a received data block may not occur (“NO” branch), execution of example process 1200 advances to step 1216.

In at least one embodiment, at step 1210 of example process 1200, data RV2 for a second transmission of a data block is generated. In at least one embodiment, data RV2 is perturbed using techniques specified in a 5G standard so that data RV2 for a second transmission of a data block differs from data in a received block of data. In at least one embodiment, data RV2 is perturbed using techniques specified in a 5G standard so that data RV2 for a second transmission of a data block differs from data RV0 of a first transmission of a data block. In at least one embodiment, after step 1210, execution of example process 1200 advances to step 1212.

In at least one embodiment, at step 1212 of example process 1200, data RV2 for a second transmission of a data block is transmitted. In at least one embodiment, after step 1212, execution of example process 1200 advances to step 1214.

In at least one embodiment, at step 1214 of example process 1200, it is determined whether a third transmission of data in a received data block may occur. In at least one embodiment, if at step 1214, it is determined that a third transmission of data in a received data block may occur (“YES” branch), execution of example process 1200 advances to step 1218. In at least one embodiment, if at step 1214, it is determined that a third transmission of data in a received data block may not occur (“NO” branch), execution of example process 1200 advances to step 1216.

In at least one embodiment, at step 1216 of example process 1200, process 1200 returns. In at least one embodiment, at step 1216, an indication of successful completion of process 1200 is returned. In at least one embodiment, an indication of successful completion of process 1200 is returned to a calling process. In at least one embodiment, an indication of successful completion of process 1200 is returned using a reporting API. In at least one embodiment, after step 1216, execution of example process 1200 terminates. In at least one embodiment, after step 1216, execution of example process 1200 continues at step 1202, with a new block.

In at least one embodiment, at step 1218 of example process 1200, data RV3 for a third transmission of a data block is generated. In at least one embodiment, data RV3 is perturbed using techniques specified in a 5G standard so that data RV3 for a third transmission of a data block differs from data in a received block of data. In at least one embodiment, data RV3 is perturbed using techniques specified in a 5G standard so that data RV3 for a third transmission of a data block differs from data RV0 of a first transmission of a data block. In at least one embodiment, data RV3 is perturbed using techniques specified in a 5G standard so that data RV3 for a third transmission of a data block differs from data RV2 of a second transmission of a data block. In at least one embodiment, after step 1218, execution of example process 1200 advances to step 1220.

In at least one embodiment, at step 1220 of example process 1200, data RV3 for a third transmission of a data block is transmitted. In at least one embodiment, after step 1220, execution of example process 1200 advances to step 1222.

In at least one embodiment, at step 1222 of example process 1200, it is determined whether a fourth transmission of data in a received data block may occur. In at least one embodiment, if at step 1222, it is determined that a fourth transmission of data in a received data block may occur (“YES” branch), execution of example process 1200 advances to step 1224. In at least one embodiment, if at step 1222, it is determined that a fourth transmission of data in a received data block may not occur (“NO” branch), execution of example process 1200 advances to step 1216 (described above).

In at least one embodiment, at step 1224 of example process 1200, data RV1 for a fourth transmission of a data block is generated. In at least one embodiment, data RV1 is perturbed using techniques specified in a 5G standard so that data RV1 for a fourth transmission of a data block differs from data in a received block of data. In at least one embodiment, data RV4 is perturbed using techniques specified in a 5G standard so that data RV1 for a fourth transmission of a data block differs from data RV0 of a first transmission of a data block. In at least one embodiment, data RV1 is perturbed using techniques specified in a 5G standard so that data RV1 for a fourth transmission of a data block differs from data RV2 of a second transmission of a data block. In at least one embodiment, data RV1 is perturbed using techniques specified in a 5G standard so that data RV1 for a fourth transmission of a data block differs from data RV3 of a third transmission of a data block. In at least one embodiment, after step 1224, execution of example process 1200 advances to step 1226.

In at least one embodiment, at step 1226 of example process 1200, data RV1 for a fourth transmission of a data block is transmitted. In at least one embodiment, after step 1226, execution of example process 1200 advances to step 1216 (described above).

FIG. 13 illustrates an example process 1300 for selecting bits in data transmission rate matching in parallel, according to at least one embodiment. In at least one embodiment, a processor such as processor 124 executes instructions to perform example process 1300. In at least one embodiment, at step 1302 of example process 1300, a circular buffer with N elements is received as described herein. In at least one embodiment, after step 1302, execution of example process 1300 advances to step 1304.

In at least one embodiment, at step 1304 of example process 1300, a plurality of threads is generated to execute example process 1300 in parallel. In at least one embodiment, a total of E threads are generated to execute example process 1300 in parallel where E is based on N (a number of data values in a received circular buffer). In at least one embodiment E may be equal to N so that, for example, one thread may process one data value in a received circular buffer in parallel. In at least one embodiment, E may be greater than N so that, for example, one or more threads may process one data value in a received circular buffer in parallel. In at least one embodiment, E may be less than N so that, for example, one thread may process one or more data values in a received circular buffer in parallel with other threads that also may process one or more data values in a received circular buffer. In at least one embodiment, after step 1304, execution of example process 1300 advances to step 1306.

In at least one embodiment, at step 1306 of example process 1300, a plurality of threads begin processing data values in a received circular buffer. In at least one embodiment, after step 1306, execution of example process 1300 advances to step 1310 for described thread 0. In at least one embodiment, after step 1306, execution of example process 1300 also advances to step 1322 to process threads 1 . . . E−1 in parallel, using techniques described in connection with steps 1310-1320.

In at least one embodiment, at step 1310 of example process 1300, an initial index K₀ is determined for thread 0 based at least in part on a 5G standard and using systems and methods such as those described herein. In at least one embodiment, after step 1310, execution of example process 1300 advances to step 1312 for thread 0. In at least one embodiment, although not illustrated in FIG. 13 , steps for other threads (i.e., thread 1, thread 2, etc.) are performed in parallel using processes like those described in connection with step 1310.

In at least one embodiment, at step 1312 of example process 1300, it is determined whether initial index K₀ is before or at K_(d) for thread 0 as described herein. In at least one embodiment, if at step 1312, it is determined that initial index K₀ is before or at K_(d) for thread 0 (“YES” branch), execution of example process 1300 advances to step 1314 for thread 0. In at least one embodiment, if at step 1312, it is determined that initial index K₀ is not before or at K_(d) for thread 0 (“NO” branch), execution of example process 1300 advances to step 1316 for thread 0. In at least one embodiment, although not illustrated in FIG. 13 , steps for other threads (i.e., thread 1, thread 2, etc.) are performed in parallel using processes like those described in connection with step 1312.

In at least one embodiment, at step 1314, example process 1300 uses algorithm one to locate selectable bits for thread 0. In at least one embodiment, InIdx is an input index that may range from 0 to E−1, as defined by a 5G standard. In at least one embodiment, for a single code block, InIdx may indicate which thread may be used for selecting a data value. In at least one embodiment, for a plurality of code blocks, InIdx may indicate which thread may be used for selecting a data value for a code block. In at least one embodiment, Ncb is an array length for a code block. In at least one embodiment, OutIdx is an output index that is returned by algorithm one. In at least one embodiment, algorithm one is implemented according to code as follows:

int algorithm_one (int inIdx, int K, int Kd,    int F, int k0, int Ncb) {  int outIdx;  // if (k0 <= Kd)  outIdx = k0 + inIdx;  while (outIdx >= Ncb)  {   outIdx −= Ncb;   outIdx += F;  }  if (outIdx >= Kd)  {   outIdx += F;  }  if (outIdx >= Ncb)  {   outIdx −= Ncb;  }  return outIdx; }

In at least one embodiment, although not illustrated in FIG. 13 , steps for other threads (i.e., thread 1, thread 2, etc.) are performed in parallel using processes like those described in connection with step 1314.

In at least one embodiment, after step 1314, execution of example process 1300 terminates for thread 0. In at least one embodiment, after step 1314, execution of example process 1300 continues at step 1302, with a new circular buffer. In at least one embodiment, processor resources associated with executing example process 1300 for thread 0 may be used to process data from another thread (i.e., thread 1, thread 2, etc.) and, after step 1314, execution of example process 1300 may continue after step 1306, with new thread data.

In at least one embodiment, at step 1316 of example process 1300, it is determined whether K₀ is at or after (K_(d)+F) for thread 0. In at least one embodiment, if at step 1316, it is determined that K₀ is at or after (K_(d)+F) for thread 0 (“YES” branch), execution of example process 1300 advances to step 1318 for thread 0. In at least one embodiment, if at step 1316, it is determined that K₀ is not at or after (K_(d)+F) for thread 0 (“NO” branch), execution of example process 1300 advances to step 1320 for thread 0. In at least one embodiment, although not illustrated in FIG. 13 , steps for other threads (i.e., thread 1, thread 2, etc.) are performed in parallel using processes like those described in connection with step 1316.

In at least one embodiment, at step 1318, example process 1300, uses algorithm two to locate selectable bits for thread 0. In at least one embodiment, InIdx is an input index that may range from 0 to E−1, as defined by a 5G standard. In at least one embodiment, for a single code block, InIdx may indicate which thread may be used for selecting a data value. In at least one embodiment, for a plurality of code blocks, InIdx may indicate which thread may be used for selecting a data value for a code block. In at least one embodiment, Ncb is an array length for a code block. In at least one embodiment, OutIdx is an output index that is returned by algorithm two. In at least one embodiment, algorithm two is implemented according to code as follows:

int algorithm_two (int inIdx, int K, int Kd, int F, int k0,     int Ncb) {  int outIdx;  // if (k0 >= (Kd + F))  outIdx = k0 + inIdx;  while (outIdx >= Ncb)  {   outIdx −= Ncb;   if (outIdx >= Kd)   {    outIdx += F;   }  }  return outIdx; }

In at least one embodiment, although not illustrated in FIG. 13 , steps for other threads (i.e., thread 1, thread 2, etc.) are performed in parallel using processes like those described in connection with step 1318.

In at least one embodiment, after step 1318, execution of example process 1300 terminates for thread 0. In at least one embodiment, after step 1318, execution of example process 1300 continues at step 1302, with a new circular buffer. In at least one embodiment, processor resources associated with executing example process 1300 for thread 0 may be used to process data from another thread (i.e., thread 1, thread 2, etc.) and, after step 1318, execution of example process 1300 may continue after step 1306, with new thread data.

In at least one embodiment, at step 1320 of example process 1300, algorithm three is used for thread 0. In at least one embodiment, InIdx is an input index that may range from 0 to E−1, as defined by a 5G standard. In at least one embodiment, for a single code block, InIdx may indicate which thread may be used for selecting a data value. In at least one embodiment, for a plurality of code blocks, InIdx may indicate which thread may be used for selecting a data value for a code block. In at least one embodiment, Ncb is an array length for a code block. In at least one embodiment, OutIdx is an output index that is returned by algorithm three. In at least one embodiment, algorithm three is used for thread 0 as a default case due to executing a “NO” branch at step 1312 and step 1316 for thread 0. In at least one embodiment, algorithm three is implemented according to code as follows:

int algorithm_three (int inIdx, int K, int Kd, int F, int k0,     int Ncb) {  int outIdx;  // if ((k0 > Kd) && (k0 < (Kd + F)))  int Fmin = K−k0;  outIdx = k0 + inIdx + Fmin;  while (outIdx >= Ncb)  {   outIdx −= Ncb;   if (outIdx >= Kd)   {    outIdx += F;   }  }  return outIdx; }

In at least one embodiment, although not illustrated in FIG. 13 , steps for other threads (i.e., thread 1, thread 2, etc.) are performed in parallel using processes like those described in connection with step 1320.

In at least one embodiment, after step 1320, execution of example process 1300 terminates for thread 0. In at least one embodiment, after step 1320, execution of example process 1300 continues at step 1302, with a new circular buffer. In at least one embodiment, processor resources associated with executing example process 1300 for thread 0 may be used to process data from another thread (i.e., thread 1, thread 2, etc.) and, after step 1320, execution of example process 1300 may continue after step 1306, with new thread data.

Data Center

FIG. 14 illustrates an example data center 1400, in which at least one embodiment may be used. In at least one embodiment, data center 1400 includes a data center infrastructure layer 1410, a framework layer 1420, a software layer 1430 and an application layer 1440.

In at least one embodiment, as shown in FIG. 14 , data center infrastructure layer 1410 may include a resource orchestrator 1412, grouped computing resources 1414, and node computing resources (“node C.R.s”) 1416(1)-1416(N), where “N” represents any whole, positive integer. In at least one embodiment, node C.R.s 1416(1)-1416(N) may include, but are not limited to, any number of central processing units (“CPUs”) or other processors (including accelerators, field programmable gate arrays (FPGAs), graphics processors, etc.), memory devices (e.g., dynamic read-only memory), storage devices (e.g., solid state or disk drives), network input/output (“NW I/O”) devices, network switches, virtual machines (“VMs”), power modules, and cooling modules, etc. In at least one embodiment, one or more node C.R.s from among node C.R.s 1416(1)-1416(N) may be a server having one or more of above-mentioned computing resources.

In at least one embodiment, grouped computing resources 1414 may include separate groupings of node C.R.s housed within one or more racks (not shown), or many racks housed in data centers at various geographical locations (also not shown). In at least one embodiment, separate groupings of node C.R.s within grouped computing resources 1414 may include grouped compute, network, memory or storage resources that may be configured or allocated to support one or more workloads. In at least one embodiment, several node C.R.s including CPUs or processors may grouped within one or more racks to provide compute resources to support one or more workloads. In at least one embodiment, one or more racks may also include any number of power modules, cooling modules, and network switches, in any combination.

In at least one embodiment, resource orchestrator 1412 may configure or otherwise control one or more node C.R.s 1416(1)-1416(N) and/or grouped computing resources 1414. In at least one embodiment, resource orchestrator 1412 may include a software design infrastructure (“SDI”) management entity for data center 1400. In at least one embodiment, resource orchestrator may include hardware, software or some combination thereof.

In at least one embodiment, as shown in FIG. 14 , framework layer 1420 includes a job scheduler 1432, a configuration manager 1434, a resource manager 1436 and a distributed file system 1438. In at least one embodiment, framework layer 1420 may include a framework to support software 1432 of software layer 1430 and/or one or more application(s) 1442 of application layer 1440. In at least one embodiment, software 1432 or application(s) 1442 may respectively include web-based service software or applications, such as those provided by Amazon Web Services, Google Cloud and Microsoft Azure. In at least one embodiment, framework layer 1420 may be, but is not limited to, a type of free and open-source software web application framework such as Apache Spark™ (hereinafter “Spark”) that may utilize distributed file system 1438 for large-scale data processing (e.g., “big data”). In at least one embodiment, job scheduler 1432 may include a Spark driver to facilitate scheduling of workloads supported by various layers of data center 1400. In at least one embodiment, configuration manager 1434 may be capable of configuring different layers such as software layer 1430 and framework layer 1420 including Spark and distributed file system 1438 for supporting large-scale data processing. In at least one embodiment, resource manager 1436 may be capable of managing clustered or grouped computing resources mapped to or allocated for support of distributed file system 1438 and job scheduler 1432. In at least one embodiment, clustered or grouped computing resources may include grouped computing resource 1414 at data center infrastructure layer 1410. In at least one embodiment, resource manager 1436 may coordinate with resource orchestrator 1412 to manage these mapped or allocated computing resources.

In at least one embodiment, software 1432 included in software layer 1430 may include software used by at least portions of node C.R.s 1416(1)-1416(N), grouped computing resources 1414, and/or distributed file system 1438 of framework layer 1420. In at least one embodiment, one or more types of software may include, but are not limited to, Internet web page search software, e-mail virus scan software, database software, and streaming video content software.

In at least one embodiment, application(s) 1442 included in application layer 1440 may include one or more types of applications used by at least portions of node C.R.s 1416(1)-1416(N), grouped computing resources 1414, and/or distributed file system 1438 of framework layer 1420. In at least one embodiment, one or more types of applications may include, but are not limited to, any number of a genomics application, a cognitive compute, and a machine learning application, including training or inferencing software, machine learning framework software (e.g., PyTorch, TensorFlow, Caffe, etc.) or other machine learning applications used in conjunction with one or more embodiments.

In at least one embodiment, any of configuration manager 1434, resource manager 1436, and resource orchestrator 1412 may implement any number and type of self-modifying actions based on any amount and type of data acquired in any technically feasible fashion. In at least one embodiment, self-modifying actions may relieve a data center operator of data center 1400 from making possibly bad configuration decisions and possibly avoiding underutilized and/or poor performing portions of a data center.

In at least one embodiment, data center 1400 may include tools, services, software or other resources to train one or more machine learning models or predict or infer information using one or more machine learning models according to one or more embodiments described herein. For example, in at least one embodiment, a machine learning model may be trained by calculating weight parameters according to a neural network architecture using software and computing resources described above with respect to data center 1400. In at least one embodiment, trained machine learning models corresponding to one or more neural networks may be used to infer or predict information using resources described above with respect to data center 1400 by using weight parameters calculated through one or more training techniques described herein.

In at least one embodiment, data center 1400 may use CPUs, application-specific integrated circuits (ASICs), GPUs, FPGAs, or other hardware to perform training and/or inferencing using above-described resources. Moreover, one or more software and/or hardware resources described above may be configured as a service to allow users to train or performing inferencing of information, such as image recognition, speech recognition, or other artificial intelligence services.

In at least one embodiment, at least one component shown or described with respect to FIG. 14 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one of grouped computing resources 1414 and node C.R. 1416(1-N) are used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one of grouped computing resources 1414 and node C.R. 1416(1-N) are used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 15A illustrates an example of an autonomous vehicle 1500, according to at least one embodiment. In at least one embodiment, autonomous vehicle 1500 (alternatively referred to herein as “vehicle 1500”) may be, without limitation, a passenger vehicle, such as a car, a truck, a bus, and/or another type of vehicle that accommodates one or more passengers. In at least one embodiment, vehicle 1500 may be a semi-tractor-trailer truck used for hauling cargo. In at least one embodiment, vehicle 1500 may be an airplane, robotic vehicle, or other kind of vehicle.

Autonomous vehicles may be described in terms of automation levels, defined by National Highway Traffic Safety Administration (“NHTSA”), a division of US Department of Transportation, and Society of Automotive Engineers (“SAE”) “Taxonomy and Definitions for Terms Related to Driving Automation Systems for On-Road Motor Vehicles” (e.g., Standard No. J3016-201806, published on Jun. 15, 2018, Standard No. J3016-201609, published on Sep. 30, 2016, and previous and future versions of this standard). In one or more embodiments, vehicle 1500 may be capable of functionality in accordance with one or more of level 1-level 5 of autonomous driving levels. For example, in at least one embodiment, vehicle 1500 may be capable of conditional automation (Level 3), high automation (Level 4), and/or full automation (Level 5), depending on embodiment.

In at least one embodiment, vehicle 1500 may include, without limitation, components such as a chassis, a vehicle body, wheels (e.g., 2, 4, 6, 8, 18, etc.), tires, axles, and other components of a vehicle. In at least one embodiment, vehicle 1500 may include, without limitation, a propulsion system 1550, such as an internal combustion engine, hybrid electric power plant, an all-electric engine, and/or another propulsion system type. In at least one embodiment, propulsion system 1550 may be connected to a drive train of vehicle 1500, which may include, without limitation, a transmission, to enable propulsion of vehicle 1500. In at least one embodiment, propulsion system 1550 may be controlled in response to receiving signals from a throttle/accelerator(s) 1552.

In at least one embodiment, a steering system 1554, which may include, without limitation, a steering wheel, is used to steer a vehicle 1500 (e.g., along a desired path or route) when a propulsion system 1550 is operating (e.g., when vehicle is in motion). In at least one embodiment, a steering system 1554 may receive signals from steering actuator(s) 1556. In at least one embodiment, steering wheel may be optional for full automation (Level 5) functionality. In at least one embodiment, a brake sensor system 1546 may be used to operate vehicle brakes in response to receiving signals from brake actuator(s) 1548 and/or brake sensors.

In at least one embodiment, controller(s) 1536, which may include, without limitation, one or more system on chips (“SoCs”) (not shown in FIG. 15A) and/or graphics processing unit(s) (“GPU(s)”), provide signals (e.g., representative of commands) to one or more components and/or systems of vehicle 1500. For instance, in at least one embodiment, controller(s) 1536 may send signals to operate vehicle brakes via brake actuators 1548, to operate steering system 1554 via steering actuator(s) 1556, to operate propulsion system 1550 via throttle/accelerator(s) 1552. In at least one embodiment, controller(s) 1536 may include one or more onboard (e.g., integrated) computing devices (e.g., supercomputers) that process sensor signals, and output operation commands (e.g., signals representing commands) to enable autonomous driving and/or to assist a human driver in driving vehicle 1500. In at least one embodiment, controller(s) 1536 may include a first controller 1536 for autonomous driving functions, a second controller 1536 for functional safety functions, a third controller 1536 for artificial intelligence functionality (e.g., computer vision), a fourth controller 1536 for infotainment functionality, a fifth controller 1536 for redundancy in emergency conditions, and/or other controllers. In at least one embodiment, a single controller 1536 may handle two or more of above functionalities, two or more controllers 1536 may handle a single functionality, and/or any combination thereof.

In at least one embodiment, controller(s) 1536 provide signals for controlling one or more components and/or systems of vehicle 1500 in response to sensor data received from one or more sensors (e.g., sensor inputs). In at least one embodiment, sensor data may be received from, for example and without limitation, global navigation satellite systems (“GNSS”) sensor(s) 1558 (e.g., Global Positioning System sensor(s)), RADAR sensor(s) 1560, ultrasonic sensor(s) 1562, LIDAR sensor(s) 1564, inertial measurement unit (“IMU”) sensor(s) 1566 (e.g., accelerometer(s), gyroscope(s), magnetic compass(es), magnetometer(s), etc.), microphone(s) 1596, stereo camera(s) 1568, wide-view camera(s) 1570 (e.g., fisheye cameras), infrared camera(s) 1572, surround camera(s) 1574 (e.g., 360 degree cameras), long-range cameras (not shown in FIG. 15A), mid-range camera(s) (not shown in FIG. 15A), speed sensor(s) 1544 (e.g., for measuring speed of vehicle 1500), vibration sensor(s) 1542, steering sensor(s) 1540, brake sensor(s) (e.g., as part of brake sensor system 1546), and/or other sensor types.

In at least one embodiment, one or more of controller(s) 1536 may receive inputs (e.g., represented by input data) from an instrument cluster 1532 of vehicle 1500 and provide outputs (e.g., represented by output data, display data, etc.) via a human-machine interface (“HMI”) display 1534, an audible annunciator, a loudspeaker, and/or via other components of vehicle 1500. In at least one embodiment, outputs may include information such as vehicle velocity, speed, time, map data (e.g., a High Definition map (not shown in FIG. 15A), location data (e.g., vehicle's 1500 location, such as on a map), direction, location of other vehicles (e.g., an occupancy grid), information about objects and status of objects as perceived by controller(s) 1536, etc. For example, in at least one embodiment, HMI display 1534 may display information about presence of one or more objects (e.g., a street sign, caution sign, traffic light changing, etc.), and/or information about driving maneuvers vehicle has made, is making, or will make (e.g., changing lanes now, taking exit 34B in two miles, etc.).

In at least one embodiment, vehicle 1500 further includes a network interface 1524 which may use wireless antenna(s) 1526 and/or modem(s) to communicate over one or more networks. For example, in at least one embodiment, network interface 1524 may be capable of communication over Long-Term Evolution (“LTE”), Wideband Code Division Multiple Access (“WCDMA”), Universal Mobile Telecommunications System (“UMTS”), Global System for Mobile communication (“GSM”), IMT-CDMA Multi-Carrier (“CDMA2000”), etc. In at least one embodiment, wireless antenna(s) 1526 may also enable communication between objects in environment (e.g., vehicles, mobile devices, etc.), using local area network(s), such as Bluetooth, Bluetooth Low Energy (“LE”), Z-Wave, ZigBee, etc., and/or low power wide-area network(s) (“LPWANs”), such as LoRaWAN, SigFox, etc.

In at least one embodiment, at least one component shown or described with respect to FIG. 15A is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, techniques and/or functions described in connection with FIGS. 1-13 may perform rate matching for data received from vehicle 1500 for its autonomous operation, and/or may be used by vehicle 1500 to perform rate matching for data received in connection with its autonomous operation.

FIG. 15B illustrates an example of camera locations and fields of view for autonomous vehicle 1500 of FIG. 15A, according to at least one embodiment. In at least one embodiment, cameras and respective fields of view are one example embodiment and are not intended to be limiting. For instance, in at least one embodiment, additional and/or alternative cameras may be included and/or cameras may be located at different locations on vehicle 1500.

In at least one embodiment, camera types for cameras may include, but are not limited to, digital cameras that may be adapted for use with components and/or systems of vehicle 1500. In at least one embodiment, camera(s) may operate at automotive safety integrity level (“ASIL”) B and/or at another ASIL. In at least one embodiment, camera types may be capable of any image capture rate, such as 60 frames per second (fps), 1220 fps, 240 fps, etc., depending on embodiment. In at least one embodiment, cameras may be capable of using rolling shutters, global shutters, another type of shutter, or a combination thereof. In at least one embodiment, color filter array may include a red clear clear clear (“RCCC”) color filter array, a red clear clear blue (“RCCB”) color filter array, a red blue green clear (“RBGC”) color filter array, a Foveon X3 color filter array, a Bayer sensors (“RGGB”) color filter array, a monochrome sensor color filter array, and/or another type of color filter array. In at least one embodiment, clear pixel cameras, such as cameras with an RCCC, an RCCB, and/or an RBGC color filter array, may be used in an effort to increase light sensitivity.

In at least one embodiment, one or more of camera(s) may be used to perform advanced driver assistance systems (“ADAS”) functions (e.g., as part of a redundant or fail-safe design). For example, in at least one embodiment, a Multi-Function Mono Camera may be installed to provide functions including lane departure warning, traffic sign assist and intelligent headlamp control. In at least one embodiment, one or more of camera(s) (e.g., all of cameras) may record and provide image data (e.g., video) simultaneously.

In at least one embodiment, one or more of cameras may be mounted in a mounting assembly, such as a custom designed (three-dimensional (“3D”) printed) assembly, in order to cut out stray light and reflections from within car (e.g., reflections from dashboard reflected in windshield mirrors) which may interfere with camera's image data capture abilities. With reference to wing-mirror mounting assemblies, in at least one embodiment, wing-mirror assemblies may be custom 3D printed so that camera mounting plate matches shape of wing-mirror. In at least one embodiment, camera(s) may be integrated into wing-mirror. In at least one embodiment, for side-view cameras, camera(s) may also be integrated within four pillars at each corner of car.

In at least one embodiment, cameras with a field of view that include portions of environment in front of vehicle 1500 (e.g., front-facing cameras) may be used for surround view, to help identify forward facing paths and obstacles, as well as aid in, with help of one or more of controllers 1536 and/or control SoCs, providing information critical to generating an occupancy grid and/or determining preferred vehicle paths. In at least one embodiment, front-facing cameras may be used to perform many of same ADAS functions as LIDAR, including, without limitation, emergency braking, pedestrian detection, and collision avoidance. In at least one embodiment, front-facing cameras may also be used for ADAS functions and systems including, without limitation, Lane Departure Warnings (“LDW”), Autonomous Cruise Control (“ACC”), and/or other functions such as traffic sign recognition.

In at least one embodiment, a variety of cameras may be used in a front-facing configuration, including, for example, a monocular camera platform that includes a CMOS (“complementary metal oxide semiconductor”) color imager. In at least one embodiment, wide-view camera 1570 may be used to perceive objects coming into view from periphery (e.g., pedestrians, crossing traffic or bicycles). Although only one wide-view camera 1570 is illustrated in FIG. 15B, in other embodiments, there may be any number (including zero) of wide-view camera(s) 1570 on vehicle 1500. In at least one embodiment, any number of long-range camera(s) 1598 (e.g., a long-view stereo camera pair) may be used for depth-based object detection, especially for objects for which a neural network has not yet been trained. In at least one embodiment, long-range camera(s) 1598 may also be used for object detection and classification, as well as basic object tracking.

In at least one embodiment, any number of stereo camera(s) 1568 may also be included in a front-facing configuration. In at least one embodiment, one or more of stereo camera(s) 1568 may include an integrated control unit comprising a scalable processing unit, which may provide a programmable logic (“FPGA”) and a multi-core micro-processor with an integrated Controller Area Network (“CAN”) or Ethernet interface on a single chip. In at least one embodiment, such a unit may be used to generate a 3D map of environment of vehicle 1500, including a distance estimate for all points in image. In at least one embodiment, one or more of stereo camera(s) 1568 may include, without limitation, compact stereo vision sensor(s) that may include, without limitation, two camera lenses (one each on left and right) and an image processing chip that may measure distance from vehicle 1500 to target object and use generated information (e.g., metadata) to activate autonomous emergency braking and lane departure warning functions. In at least one embodiment, other types of stereo camera(s) 1568 may be used in addition to, or alternatively from, those described herein.

In at least one embodiment, cameras with a field of view that include portions of environment to side of vehicle 1500 (e.g., side-view cameras) may be used for surround view, providing information used to create and update occupancy grid, as well as to generate side impact collision warnings. For example, in at least one embodiment, surround camera(s) 1574 (e.g., four surround cameras 1574 as illustrated in FIG. 15B) could be positioned on vehicle 1500. In at least one embodiment, surround camera(s) 1574 may include, without limitation, any number and combination of wide-view camera(s) 1570, fisheye camera(s), 360 degree camera(s), and/or like. For instance, in at least one embodiment, four fisheye cameras may be positioned on front, rear, and sides of vehicle 1500. In at least one embodiment, vehicle 1500 may use three surround camera(s) 1574 (e.g., left, right, and rear), and may leverage one or more other camera(s) (e.g., a forward-facing camera) as a fourth surround-view camera.

In at least one embodiment, cameras with a field of view that include portions of environment to rear of vehicle 1500 (e.g., rear-view cameras) may be used for park assistance, surround view, rear collision warnings, and creating and updating occupancy grid. In at least one embodiment, a wide variety of cameras may be used including, but not limited to, cameras that are also suitable as a front-facing camera(s) (e.g., long-range cameras 1598 and/or mid-range camera(s) 1576, stereo camera(s) 1568), infrared camera(s) 1572, etc.), as described herein.

In at least one embodiment, at least one component shown or described with respect to FIG. 15B is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, techniques and/or functions described in connection with FIGS. 1-13 may perform rate matching for data received from vehicle 1500 for its autonomous operation, and/or may be used by vehicle 1500 to perform rate matching for data received in connection with its autonomous operation.

FIG. 15C is a block diagram illustrating an example system architecture for autonomous vehicle 1500 of FIG. 15A, according to at least one embodiment. In at least one embodiment, each of components, features, and systems of vehicle 1500 in FIG. 15C are illustrated as being connected via a bus 1502. In at least one embodiment, bus 1502 may include, without limitation, a CAN data interface (alternatively referred to herein as a “CAN bus”). In at least one embodiment, a CAN may be a network inside vehicle 1500 used to aid in control of various features and functionality of vehicle 1500, such as actuation of brakes, acceleration, braking, steering, windshield wipers, etc. In at least one embodiment, bus 1502 may be configured to have dozens or even hundreds of nodes, each with its own unique identifier (e.g., a CAN ID). In at least one embodiment, bus 1502 may be read to find steering wheel angle, ground speed, engine revolutions per minute (“RPMs”), button positions, and/or other vehicle status indicators. In at least one embodiment, bus 1502 may be a CAN bus that is ASIL B compliant.

In at least one embodiment, in addition to, or alternatively from CAN, FlexRay and/or Ethernet may be used. In at least one embodiment, there may be any number of busses 1502, which may include, without limitation, zero or more CAN busses, zero or more FlexRay busses, zero or more Ethernet busses, and/or zero or more other types of busses using a different protocol. In at least one embodiment, two or more busses 1502 may be used to perform different functions, and/or may be used for redundancy. For example, a first bus 1502 may be used for collision avoidance functionality and a second bus 1502 may be used for actuation control. In at least one embodiment, each bus 1502 may communicate with any of components of vehicle 1500, and two or more busses 1502 may communicate with same components. In at least one embodiment, each of any number of system(s) on chip(s) (“SoC(s)”) 1504, each of controller(s) 1536, and/or each computer within vehicle may have access to same input data (e.g., inputs from sensors of vehicle 1500), and may be connected to a common bus, such CAN bus.

In at least one embodiment, vehicle 1500 may include one or more controller(s) 1536, such as those described herein with respect to FIG. 15A. In at least one embodiment, controller(s) 1536 may be used for a variety of functions. In at least one embodiment, controller(s) 1536 may be coupled to any of various other components and systems of vehicle 1500, and may be used for control of vehicle 1500, artificial intelligence of vehicle 1500, infotainment for vehicle 1500, and/or like.

In at least one embodiment, vehicle 1500 may include any number of SoCs 1504. Each of SoCs 1504 may include, without limitation, central processing units (“CPU(s)”) 1506, graphics processing units (“GPU(s)”) 1508, processor(s) 1510, cache(s) 1512, accelerator(s) 1514, data store(s) 1516, and/or other components and features not illustrated. In at least one embodiment, SoC(s) 1504 may be used to control vehicle 1500 in a variety of platforms and systems. For example, in at least one embodiment, SoC(s) 1504 may be combined in a system (e.g., system of vehicle 1500) with a High Definition (“HD”) map 1522 which may obtain map refreshes and/or updates via network interface 1524 from one or more servers (not shown in FIG. 15C).

In at least one embodiment, CPU(s) 1506 may include a CPU cluster or CPU complex (alternatively referred to herein as a “CCPLEX”). In at least one embodiment, CPU(s) 1506 may include multiple cores and/or level two (“L2”) caches. For instance, in at least one embodiment, CPU(s) 1506 may include eight cores in a coherent multi-processor configuration. In at least one embodiment, CPU(s) 1506 may include four dual-core clusters where each cluster has a dedicated L2 cache (e.g., a 2 MB L2 cache). In at least one embodiment, CPU(s) 1506 (e.g., CCPLEX) may be configured to support simultaneous cluster operation enabling any combination of clusters of CPU(s) 1506 to be active at any given time.

In at least one embodiment, one or more of CPU(s) 1506 may implement power management capabilities that include, without limitation, one or more of following features: individual hardware blocks may be clock-gated automatically when idle to save dynamic power; each core clock may be gated when core is not actively executing instructions due to execution of Wait for Interrupt (“WFI”)/Wait for Event (“WFE”) instructions; each core may be independently power-gated; each core cluster may be independently clock-gated when all cores are clock-gated or power-gated; and/or each core cluster may be independently power-gated when all cores are power-gated. In at least one embodiment, CPU(s) 1506 may further implement an enhanced algorithm for managing power states, where allowed power states and expected wakeup times are specified, and hardware/microcode determines best power state to enter for core, cluster, and CCPLEX. In at least one embodiment, processing cores may support simplified power state entry sequences in software with work offloaded to microcode.

In at least one embodiment, GPU(s) 1508 may include an integrated GPU (alternatively referred to herein as an “iGPU”). In at least one embodiment, GPU(s) 1508 may be programmable and may be efficient for parallel workloads. In at least one embodiment, GPU(s) 1508, in at least one embodiment, may use an enhanced tensor instruction set. In on embodiment, GPU(s) 1508 may include one or more streaming microprocessors, where each streaming microprocessor may include a level one (“L1”) cache (e.g., an L1 cache with at least 96 KB storage capacity), and two or more of streaming microprocessors may share an L2 cache (e.g., an L2 cache with a 512 KB storage capacity). In at least one embodiment, GPU(s) 1508 may include at least eight streaming microprocessors. In at least one embodiment, GPU(s) 1508 may use compute application programming interface(s) (API(s)). In at least one embodiment, GPU(s) 1508 may use one or more parallel computing platforms and/or programming models (e.g., NVIDIA's CUDA).

In at least one embodiment, one or more of GPU(s) 1508 may be power-optimized for best performance in automotive and embedded use cases. For example, in on embodiment, GPU(s) 1508 could be fabricated on a Fin field-effect transistor (“FinFET”). In at least one embodiment, each streaming microprocessor may incorporate a number of mixed-precision processing cores partitioned into multiple blocks. For example, and without limitation, 64 PF32 cores and 32 PF64 cores could be partitioned into four processing blocks. In at least one embodiment, each processing block could be allocated 16 FP32 cores, 8 FP64 cores, 16 INT32 cores, two mixed-precision NVIDIA TENSOR COREs for deep learning matrix arithmetic, a level zero (“L0”) instruction cache, a warp scheduler, a dispatch unit, and/or a 64 KB register file. In at least one embodiment, streaming microprocessors may include independent parallel integer and floating-point data paths to provide for efficient execution of workloads with a mix of computation and addressing calculations. In at least one embodiment, streaming microprocessors may include independent thread scheduling capability to enable finer-grain synchronization and cooperation between parallel threads. In at least one embodiment, streaming microprocessors may include a combined L1 data cache and shared memory unit in order to improve performance while simplifying programming.

In at least one embodiment, one or more of GPU(s) 1508 may include a high bandwidth memory (“HBM) and/or a 16 GB HBM2 memory subsystem to provide, in some examples, about 900 GB/second peak memory bandwidth. In at least one embodiment, in addition to, or alternatively from, HBM memory, a synchronous graphics random-access memory (“SGRAM”) may be used, such as a graphics double data rate type five synchronous random-access memory (“GDDR5”).

In at least one embodiment, GPU(s) 1508 may include unified memory technology. In at least one embodiment, address translation services (“ATS”) support may be used to allow GPU(s) 1508 to access CPU(s) 1506 page tables directly. In at least one embodiment, embodiment, when GPU(s) 1508 memory management unit (“MMU”) experiences a miss, an address translation request may be transmitted to CPU(s) 1506. In response, CPU(s) 1506 may look in its page tables for virtual-to-physical mapping for address and transmits translation back to GPU(s) 1508, in at least one embodiment. In at least one embodiment, unified memory technology may allow a single unified virtual address space for memory of both CPU(s) 1506 and GPU(s) 1508, thereby simplifying GPU(s) 1508 programming and porting of applications to GPU(s) 1508.

In at least one embodiment, GPU(s) 1508 may include any number of access counters that may keep track of frequency of access of GPU(s) 1508 to memory of other processors. In at least one embodiment, access counter(s) may help ensure that memory pages are moved to physical memory of processor that is accessing pages most frequently, thereby improving efficiency for memory ranges shared between processors.

In at least one embodiment, one or more of SoC(s) 1504 may include any number of cache(s) 1512, including those described herein. For example, in at least one embodiment, cache(s) 1512 could include a level three (“L3”) cache that is available to both CPU(s) 1506 and GPU(s) 1508 (e.g., that is connected both CPU(s) 1506 and GPU(s) 1508). In at least one embodiment, cache(s) 1512 may include a write-back cache that may keep track of states of lines, such as by using a cache coherence protocol (e.g., MEI, MESI, MSI, etc.). In at least one embodiment, L3 cache may include 4 MB or more, depending on embodiment, although smaller cache sizes may be used.

In at least one embodiment, one or more of SoC(s) 1504 may include one or more accelerator(s) 1514 (e.g., hardware accelerators, software accelerators, or a combination thereof). In at least one embodiment, SoC(s) 1504 may include a hardware acceleration cluster that may include optimized hardware accelerators and/or large on-chip memory. In at least one embodiment, large on-chip memory (e.g., 4 MB of SRAM), may enable hardware acceleration cluster to accelerate neural networks and other calculations. In at least one embodiment, hardware acceleration cluster may be used to complement GPU(s) 1508 and to off-load some of tasks of GPU(s) 1508 (e.g., to free up more cycles of GPU(s) 1508 for performing other tasks). In at least one embodiment, accelerator(s) 1514 could be used for targeted workloads (e.g., perception, convolutional neural networks (“CNNs”), recurrent neural networks (“RNNs”), etc.) that are stable enough to be amenable to acceleration. In at least one embodiment, a CNN may include a region-based or regional convolutional neural networks (“RCNNs”) and Fast RCNNs (e.g., as used for object detection) or other type of CNN.

In at least one embodiment, accelerator(s) 1514 (e.g., hardware acceleration cluster) may include a deep learning accelerator(s) (“DLA). DLA(s) may include, without limitation, one or more Tensor processing units (“TPUs) that may be configured to provide an additional ten trillion operations per second for deep learning applications and inferencing. In at least one embodiment, TPUs may be accelerators configured to, and optimized for, performing image processing functions (e.g., for CNNs, RCNNs, etc.). DLA(s) may further be optimized for a specific set of neural network types and floating point operations, as well as inferencing. In at least one embodiment, design of DLA(s) may provide more performance per millimeter than a typical general-purpose GPU, and typically vastly exceeds performance of a CPU. In at least one embodiment, TPU(s) may perform several functions, including a single-instance convolution function, supporting, for example, INT8, INT16, and FP16 data types for both features and weights, as well as post-processor functions. In at least one embodiment, DLA(s) may quickly and efficiently execute neural networks, especially CNNs, on processed or unprocessed data for any of a variety of functions, including, for example and without limitation: a CNN for object identification and detection using data from camera sensors; a CNN for distance estimation using data from camera sensors; a CNN for emergency vehicle detection and identification and detection using data from microphones 1596; a CNN for facial recognition and vehicle owner identification using data from camera sensors; and/or a CNN for security and/or safety related events.

In at least one embodiment, DLA(s) may perform any function of GPU(s) 1508, and by using an inference accelerator, for example, a designer may target either DLA(s) or GPU(s) 1508 for any function. For example, in at least one embodiment, designer may focus processing of CNNs and floating point operations on DLA(s) and leave other functions to GPU(s) 1508 and/or other accelerator(s) 1514.

In at least one embodiment, accelerator(s) 1514 (e.g., hardware acceleration cluster) may include a programmable vision accelerator(s) (“PVA”), which may alternatively be referred to herein as a computer vision accelerator. In at least one embodiment, PVA(s) may be designed and configured to accelerate computer vision algorithms for advanced driver assistance system (“ADAS”) 1538, autonomous driving, augmented reality (“AR”) applications, and/or virtual reality (“VR”) applications. PVA(s) may provide a balance between performance and flexibility. For example, in at least one embodiment, each PVA(s) may include, for example and without limitation, any number of reduced instruction set computer (“RISC”) cores, direct memory access (“DMA”), and/or any number of vector processors.

In at least one embodiment, RISC cores may interact with image sensors (e.g., image sensors of any of cameras described herein), image signal processor(s), and/or like. In at least one embodiment, each of RISC cores may include any amount of memory. In at least one embodiment, RISC cores may use any of a number of protocols, depending on embodiment. In at least one embodiment, RISC cores may execute a real-time operating system (“RTOS”). In at least one embodiment, RISC cores may be implemented using one or more integrated circuit devices, application specific integrated circuits (“ASICs”), and/or memory devices. For example, in at least one embodiment, RISC cores could include an instruction cache and/or a tightly coupled RAM.

In at least one embodiment, DMA may enable components of PVA(s) to access system memory independently of CPU(s) 1506. In at least one embodiment, DMA may support any number of features used to provide optimization to PVA including, but not limited to, supporting multi-dimensional addressing and/or circular addressing. In at least one embodiment, DMA may support up to six or more dimensions of addressing, which may include, without limitation, block width, block height, block depth, horizontal block stepping, vertical block stepping, and/or depth stepping.

In at least one embodiment, vector processors may be programmable processors that may be designed to efficiently and flexibly execute programming for computer vision algorithms and provide signal processing capabilities. In at least one embodiment, PVA may include a PVA core and two vector processing subsystem partitions. In at least one embodiment, PVA core may include a processor subsystem, DMA engine(s) (e.g., two DMA engines), and/or other peripherals. In at least one embodiment, vector processing subsystem may operate as primary processing engine of PVA, and may include a vector processing unit (“VPU”), an instruction cache, and/or vector memory (e.g., “VMEM”). In at least one embodiment, VPU core may include a digital signal processor such as, for example, a single instruction, multiple data (“SINMD”), very long instruction word (“VLIW”) digital signal processor. In at least one embodiment, a combination of SIMD and VLIW may enhance throughput and speed.

In at least one embodiment, each of vector processors may include an instruction cache and may be coupled to dedicated memory. As a result, in at least one embodiment, each of vector processors may be configured to execute independently of other vector processors. In at least one embodiment, vector processors that are included in a particular PVA may be configured to employ data parallelism. For instance, in at least one embodiment, plurality of vector processors included in a single PVA may execute same computer vision algorithm, but on different regions of an image. In at least one embodiment, vector processors included in a particular PVA may simultaneously execute different computer vision algorithms, on same image, or even execute different algorithms on sequential images or portions of an image. In at least one embodiment, among other things, any number of PVAs may be included in hardware acceleration cluster and any number of vector processors may be included in each of PVAs. In at least one embodiment, PVA(s) may include additional error correcting code (“ECC”) memory, to enhance overall system safety.

In at least one embodiment, accelerator(s) 1514 (e.g., hardware acceleration cluster) may include a computer vision network on-chip and static random-access memory (“SRAM”), for providing a high-bandwidth, low latency SRAM for accelerator(s) 1514. In at least one embodiment, on-chip memory may include at least 4 MB SRAM, consisting of, for example and without limitation, eight field-configurable memory blocks, that may be accessible by both PVA and DLA. In at least one embodiment, each pair of memory blocks may include an advanced peripheral bus (“APB”) interface, configuration circuitry, a controller, and a multiplexer. In at least one embodiment, any type of memory may be used. In at least one embodiment, PVA and DLA may access memory via a backbone that provides PVA and DLA with high-speed access to memory. In at least one embodiment, backbone may include a computer vision network on-chip that interconnects PVA and DLA to memory (e.g., using APB).

In at least one embodiment, computer vision network on-chip may include an interface that determines, before transmission of any control signal/address/data, that both PVA and DLA provide ready and valid signals. In at least one embodiment, an interface may provide for separate phases and separate channels for transmitting control signals/addresses/data, as well as burst-type communications for continuous data transfer. In at least one embodiment, an interface may comply with International Organization for Standardization (“ISO”) 26262 or International Electrotechnical Commission (“IEC”) 61508 standards, although other standards and protocols may be used.

In at least one embodiment, one or more of SoC(s) 1504 may include a real-time ray-tracing hardware accelerator. In at least one embodiment, real-time ray-tracing hardware accelerator may be used to quickly and efficiently determine positions and extents of objects (e.g., within a world model), to generate real-time visualization simulations, for RADAR signal interpretation, for sound propagation synthesis and/or analysis, for simulation of SONAR systems, for general wave propagation simulation, for comparison to LIDAR data for purposes of localization and/or other functions, and/or for other uses.

In at least one embodiment, accelerator(s) 1514 (e.g., hardware accelerator cluster) have a wide array of uses for autonomous driving. In at least one embodiment, PVA may be a programmable vision accelerator that may be used for key processing stages in ADAS and autonomous vehicles. In at least one embodiment, PVA's capabilities are a good match for algorithmic domains needing predictable processing, at low power and low latency. In other words, PVA performs well on semi-dense or dense regular computation, even on small data sets, which need predictable run-times with low latency and low power. In at least one embodiment, autonomous vehicles, such as vehicle 1500, PVAs are designed to run classic computer vision algorithms, as they are efficient at object detection and operating on integer math.

For example, according to at least one embodiment of technology, PVA is used to perform computer stereo vision. In at least one embodiment, semi-global matching-based algorithm may be used in some examples, although this is not intended to be limiting. In at least one embodiment, applications for Level 3-5 autonomous driving use motion estimation/stereo matching on-the-fly (e.g., structure from motion, pedestrian recognition, lane detection, etc.). In at least one embodiment, PVA may perform computer stereo vision function on inputs from two monocular cameras.

In at least one embodiment, PVA may be used to perform dense optical flow. For example, in at least one embodiment, PVA could process raw RADAR data (e.g., using a 4D Fast Fourier Transform) to provide processed RADAR data. In at least one embodiment, PVA is used for time of flight depth processing, by processing raw time of flight data to provide processed time of flight data, for example.

In at least one embodiment, DLA may be used to run any type of network to enhance control and driving safety, including for example and without limitation, a neural network that outputs a measure of confidence for each object detection. In at least one embodiment, confidence may be represented or interpreted as a probability, or as providing a relative “weight” of each detection compared to other detections. In at least one embodiment, confidence enables a system to make further decisions regarding which detections should be considered as true positive detections rather than false positive detections. In at least one embodiment, a system may set a threshold value for confidence and consider only detections exceeding threshold value as true positive detections. In an embodiment in which an automatic emergency braking (“AEB”) system is used, false positive detections would cause vehicle to automatically perform emergency braking, which is obviously undesirable. In at least one embodiment, highly confident detections may be considered as triggers for AEB. In at least one embodiment, DLA may run a neural network for regressing confidence value. In at least one embodiment, neural network may take as its input at least some subset of parameters, such as bounding box dimensions, ground plane estimate obtained (e.g. from another subsystem), output from IMU sensor(s) 1566 that correlates with vehicle 1500 orientation, distance, 3D location estimates of object obtained from neural network and/or other sensors (e.g., LIDAR sensor(s) 1564 or RADAR sensor(s) 1560), among others.

In at least one embodiment, one or more of SoC(s) 1504 may include data store(s) 1516 (e.g., memory). In at least one embodiment, data store(s) 1516 may be on-chip memory of SoC(s) 1504, which may store neural networks to be executed on GPU(s) 1508 and/or DLA. In at least one embodiment, data store(s) 1516 may be large enough in capacity to store multiple instances of neural networks for redundancy and safety. In at least one embodiment, data store(s) 1512 may comprise L2 or L3 cache(s).

In at least one embodiment, one or more of SoC(s) 1504 may include any number of processor(s) 1510 (e.g., embedded processors). In at least one embodiment, processor(s) 1510 may include a boot and power management processor that may be a dedicated processor and subsystem to handle boot power and management functions and related security enforcement. In at least one embodiment, boot and power management processor may be a part of SoC(s) 1504 boot sequence and may provide runtime power management services. In at least one embodiment, boot power and management processor may provide clock and voltage programming, assistance in system low power state transitions, management of SoC(s) 1504 thermals and temperature sensors, and/or management of SoC(s) 1504 power states. In at least one embodiment, each temperature sensor may be implemented as a ring-oscillator whose output frequency is proportional to temperature, and SoC(s) 1504 may use ring-oscillators to detect temperatures of CPU(s) 1506, GPU(s) 1508, and/or accelerator(s) 1514. In at least one embodiment, if temperatures are determined to exceed a threshold, then boot and power management processor may enter a temperature fault routine and put SoC(s) 1504 into a lower power state and/or put vehicle 1500 into a chauffeur to safe stop mode (e.g., bring vehicle 1500 to a safe stop).

In at least one embodiment, processor(s) 1510 may further include a set of embedded processors that may serve as an audio processing engine. In at least one embodiment, audio processing engine may be an audio subsystem that enables full hardware support for multi-channel audio over multiple interfaces, and a broad and flexible range of audio I/O interfaces. In at least one embodiment, audio processing engine is a dedicated processor core with a digital signal processor with dedicated RAM.

In at least one embodiment, processor(s) 1510 may further include an always on processor engine that may provide necessary hardware features to support low power sensor management and wake use cases. In at least one embodiment, always on processor engine may include, without limitation, a processor core, a tightly coupled RAM, supporting peripherals (e.g., timers and interrupt controllers), various I/O controller peripherals, and routing logic.

In at least one embodiment, processor(s) 1510 may further include a safety cluster engine that includes, without limitation, a dedicated processor subsystem to handle safety management for automotive applications. In at least one embodiment, safety cluster engine may include, without limitation, two or more processor cores, a tightly coupled RAM, support peripherals (e.g., timers, an interrupt controller, etc.), and/or routing logic. In a safety mode, two or more cores may operate, in at least one embodiment, in a lockstep mode and function as a single core with comparison logic to detect any differences between their operations. In at least one embodiment, processor(s) 1510 may further include a real-time camera engine that may include, without limitation, a dedicated processor subsystem for handling real-time camera management. In at least one embodiment, processor(s) 1510 may further include a high-dynamic range signal processor that may include, without limitation, an image signal processor that is a hardware engine that is part of camera processing pipeline.

In at least one embodiment, processor(s) 1510 may include a video image compositor that may be a processing block (e.g., implemented on a microprocessor) that implements video post-processing functions needed by a video playback application to produce final image for player window. In at least one embodiment, video image compositor may perform lens distortion correction on wide-view camera(s) 1570, surround camera(s) 1574, and/or on in-cabin monitoring camera sensor(s). In at least one embodiment, in-cabin monitoring camera sensor(s) are preferably monitored by a neural network running on another instance of SoC 1504, configured to identify in cabin events and respond accordingly. In at least one embodiment, an in-cabin system may perform, without limitation, lip reading to activate cellular service and place a phone call, dictate emails, change vehicle's destination, activate or change vehicle's infotainment system and settings, or provide voice-activated web surfing. In at least one embodiment, certain functions are available to driver when vehicle is operating in an autonomous mode and are disabled otherwise.

In at least one embodiment, video image compositor may include enhanced temporal noise reduction for both spatial and temporal noise reduction. For example, in at least one embodiment, where motion occurs in a video, noise reduction weights spatial information appropriately, decreasing weight of information provided by adjacent frames. In at least one embodiment, where an image or portion of an image does not include motion, temporal noise reduction performed by video image compositor may use information from previous image to reduce noise in current image.

In at least one embodiment, video image compositor may also be configured to perform stereo rectification on input stereo lens frames. In at least one embodiment, video image compositor may further be used for user interface composition when operating system desktop is in use, and GPU(s) 1508 are not required to continuously render new surfaces. In at least one embodiment, when GPU(s) 1508 are powered on and active doing 3D rendering, video image compositor may be used to offload GPU(s) 1508 to improve performance and responsiveness.

In at least one embodiment, one or more of SoC(s) 1504 may further include a mobile industry processor interface (“MIPI”) camera serial interface for receiving video and input from cameras, a high-speed interface, and/or a video input block that may be used for camera and related pixel input functions. In at least one embodiment, one or more of SoC(s) 1504 may further include an input/output controller(s) that may be controlled by software and may be used for receiving I/O signals that are uncommitted to a specific role.

In at least one embodiment, one or more of SoC(s) 1504 may further include a broad range of peripheral interfaces to enable communication with peripherals, audio encoders/decoders (“codecs”), power management, and/or other devices. SoC(s) 1504 may be used to process data from cameras (e.g., connected over Gigabit Multimedia Serial Link and Ethernet), sensors (e.g., LIDAR sensor(s) 1564, RADAR sensor(s) 1560, etc. that may be connected over Ethernet), data from bus 1502 (e.g., speed of vehicle 1500, steering wheel position, etc.), data from GNSS sensor(s) 1558 (e.g., connected over Ethernet or CAN bus), etc. In at least one embodiment, one or more of SoC(s) 1504 may further include dedicated high-performance mass storage controllers that may include their own DMA engines, and that may be used to free CPU(s) 1506 from routine data management tasks.

In at least one embodiment, SoC(s) 1504 may be an end-to-end platform with a flexible architecture that spans automation levels 3-5, thereby providing a comprehensive functional safety architecture that leverages and makes efficient use of computer vision and ADAS techniques for diversity and redundancy, provides a platform for a flexible, reliable driving software stack, along with deep learning tools. In at least one embodiment, SoC(s) 1504 may be faster, more reliable, and even more energy-efficient and space-efficient than conventional systems. For example, in at least one embodiment, accelerator(s) 1514, when combined with CPU(s) 1506, GPU(s) 1508, and data store(s) 1516, may provide for a fast, efficient platform for level 3-5 autonomous vehicles.

In at least one embodiment, computer vision algorithms may be executed on CPUs, which may be configured using high-level programming language, such as C programming language, to execute a wide variety of processing algorithms across a wide variety of visual data. However, in at least one embodiment, CPUs are oftentimes unable to meet performance requirements of many computer vision applications, such as those related to execution time and power consumption, for example. In at least one embodiment, many CPUs are unable to execute complex object detection algorithms in real-time, which is used in in-vehicle ADAS applications and in practical Level 3-5 autonomous vehicles.

Embodiments described herein allow for multiple neural networks to be performed simultaneously and/or sequentially, and for results to be combined together to enable Level 3-5 autonomous driving functionality. For example, in at least one embodiment, a CNN executing on DLA or discrete GPU (e.g., GPU(s) 1520) may include text and word recognition, allowing supercomputer to read and understand traffic signs, including signs for which neural network has not been specifically trained. In at least one embodiment, DLA may further include a neural network that is able to identify, interpret, and provide semantic understanding of sign, and to pass that semantic understanding to path planning modules running on CPU Complex.

In at least one embodiment, multiple neural networks may be run simultaneously, as for Level 3, 4, or 5 driving. For example, in at least one embodiment, a warning sign consisting of “Caution: flashing lights indicate icy conditions,” along with an electric light, may be independently or collectively interpreted by several neural networks. In at least one embodiment, sign itself may be identified as a traffic sign by a first deployed neural network (e.g., a neural network that has been trained), text “flashing lights indicate icy conditions” may be interpreted by a second deployed neural network, which informs vehicle's path planning software (preferably executing on CPU Complex) that when flashing lights are detected, icy conditions exist. In at least one embodiment, flashing light may be identified by operating a third deployed neural network over multiple frames, informing vehicle's path-planning software of presence (or absence) of flashing lights. In at least one embodiment, all three neural networks may run simultaneously, such as within DLA and/or on GPU(s) 1508.

In at least one embodiment, a CNN for facial recognition and vehicle owner identification may use data from camera sensors to identify presence of an authorized driver and/or owner of vehicle 1500. In at least one embodiment, an always on sensor processing engine may be used to unlock vehicle when owner approaches driver door and turn on lights, and, in security mode, to disable vehicle when owner leaves vehicle. In this way, SoC(s) 1504 provide for security against theft and/or carjacking.

In at least one embodiment, a CNN for emergency vehicle detection and identification may use data from microphones 1596 to detect and identify emergency vehicle sirens. In at least one embodiment, SoC(s) 1504 use CNN for classifying environmental and urban sounds, as well as classifying visual data. In at least one embodiment, CNN running on DLA is trained to identify relative closing speed of emergency vehicle (e.g., by using Doppler effect). In at least one embodiment, CNN may also be trained to identify emergency vehicles specific to local area in which vehicle is operating, as identified by GNSS sensor(s) 1558. In at least one embodiment, when operating in Europe, CNN will seek to detect European sirens, and when in United States CNN will seek to identify only North American sirens. In at least one embodiment, once an emergency vehicle is detected, a control program may be used to execute an emergency vehicle safety routine, slowing vehicle, pulling over to side of road, parking vehicle, and/or idling vehicle, with assistance of ultrasonic sensor(s) 1562, until emergency vehicle(s) passes.

In at least one embodiment, vehicle 1500 may include CPU(s) 1518 (e.g., discrete CPU(s), or dCPU(s)), that may be coupled to SoC(s) 1504 via a high-speed interconnect (e.g., PCIe). In at least one embodiment, CPU(s) 1518 may include an X86 processor, for example. CPU(s) 1518 may be used to perform any of a variety of functions, including arbitrating potentially inconsistent results between ADAS sensors and SoC(s) 1504, and/or monitoring status and health of controller(s) 1536 and/or an infotainment system on a chip (“infotainment SoC”) 1530, for example.

In at least one embodiment, vehicle 1500 may include GPU(s) 1520 (e.g., discrete GPU(s), or dGPU(s)), that may be coupled to SoC(s) 1504 via a high-speed interconnect (e.g., NVIDIA's NVLINK). In at least one embodiment, GPU(s) 1520 may provide additional artificial intelligence functionality, such as by executing redundant and/or different neural networks, and may be used to train and/or update neural networks based at least in part on input (e.g., sensor data) from sensors of vehicle 1500.

In at least one embodiment, vehicle 1500 may further include network interface 1524 which may include, without limitation, wireless antenna(s) 1526 (e.g., one or more wireless antennas 1526 for different communication protocols, such as a cellular antenna, a Bluetooth antenna, etc.). In at least one embodiment, network interface 1524 may be used to enable wireless connectivity over Internet with cloud (e.g., with server(s) and/or other network devices), with other vehicles, and/or with computing devices (e.g., client devices of passengers). In at least one embodiment, to communicate with other vehicles, a direct link may be established between vehicle 150 and other vehicle and/or an indirect link may be established (e.g., across networks and over Internet). In at least one embodiment, direct links may be provided using a vehicle-to-vehicle communication link. In at least one embodiment, vehicle-to-vehicle communication link may provide vehicle 1500 information about vehicles in proximity to vehicle 1500 (e.g., vehicles in front of, on side of, and/or behind vehicle 1500). In at least one embodiment, aforementioned functionality may be part of a cooperative adaptive cruise control functionality of vehicle 1500.

In at least one embodiment, network interface 1524 may include an SoC that provides modulation and demodulation functionality and enables controller(s) 1536 to communicate over wireless networks. In at least one embodiment, network interface 1524 may include a radio frequency front-end for up-conversion from baseband to radio frequency, and down conversion from radio frequency to baseband. In at least one embodiment, frequency conversions may be performed in any technically feasible fashion. For example, frequency conversions could be performed through well-known processes, and/or using super-heterodyne processes. In at least one embodiment, radio frequency front end functionality may be provided by a separate chip. In at least one embodiment, network interface may include wireless functionality for communicating over LTE, WCDMA, UMTS, GSM, CDMA2000, Bluetooth, Bluetooth LE, Wi-Fi, Z-Wave, ZigBee, LoRaWAN, and/or other wireless protocols.

In at least one embodiment, vehicle 1500 may further include data store(s) 1528 which may include, without limitation, off-chip (e.g., off SoC(s) 1504) storage. In at least one embodiment, data store(s) 1528 may include, without limitation, one or more storage elements including RAM, SRAM, dynamic random-access memory (“DRAM”), video random-access memory (“VRAM”), Flash, hard disks, and/or other components and/or devices that may store at least one bit of data.

In at least one embodiment, vehicle 1500 may further include GNSS sensor(s) 1558 (e.g., GPS and/or assisted GPS sensors), to assist in mapping, perception, occupancy grid generation, and/or path planning functions. In at least one embodiment, any number of GNSS sensor(s) 1558 may be used, including, for example and without limitation, a GPS using a USB connector with an Ethernet to Serial (e.g., RS-232) bridge.

In at least one embodiment, vehicle 1500 may further include RADAR sensor(s) 1560. RADAR sensor(s) 1560 may be used by vehicle 1500 for long-range vehicle detection, even in darkness and/or severe weather conditions. In at least one embodiment, RADAR functional safety levels may be ASIL B. RADAR sensor(s) 1560 may use CAN and/or bus 1502 (e.g., to transmit data generated by RADAR sensor(s) 1560) for control and to access object tracking data, with access to Ethernet to access raw data in some examples. In at least one embodiment, wide variety of RADAR sensor types may be used. For example, and without limitation, RADAR sensor(s) 1560 may be suitable for front, rear, and side RADAR use. In at least one embodiment, one or more of RADAR sensors(s) 1560 are Pulse Doppler RADAR sensor(s).

In at least one embodiment, RADAR sensor(s) 1560 may include different configurations, such as long-range with narrow field of view, short-range with wide field of view, short-range side coverage, etc. In at least one embodiment, long-range RADAR may be used for adaptive cruise control functionality. In at least one embodiment, long-range RADAR systems may provide a broad field of view realized by two or more independent scans, such as within a 250 m range. In at least one embodiment, RADAR sensor(s) 1560 may help in distinguishing between static and moving objects, and may be used by ADAS system 1538 for emergency brake assist and forward collision warning. In at least one embodiment, sensors 1560(s) included in a long-range RADAR system may include, without limitation, monostatic multimodal RADAR with multiple (e.g., six or more) fixed RADAR antennae and a high-speed CAN and FlexRay interface. In at least one embodiment, with six antennae, central four antennae may create a focused beam pattern, designed to record vehicle's 1500 surroundings at higher speeds with minimal interference from traffic in adjacent lanes. In at least one embodiment, other two antennae may expand field of view, making it possible to quickly detect vehicles entering or leaving vehicle's 1500 lane.

In at least one embodiment, mid-range RADAR systems may include, as an example, a range of up to 160 m (front) or 80 m (rear), and a field of view of up to 42 degrees (front) or 150 degrees (rear). In at least one embodiment, short-range RADAR systems may include, without limitation, any number of RADAR sensor(s) 1560 designed to be installed at both ends of rear bumper. When installed at both ends of rear bumper, in at least one embodiment, a RADAR sensor system may create two beams that constantly monitor blind spot in rear and next to vehicle. In at least one embodiment, short-range RADAR systems may be used in ADAS system 1538 for blind spot detection and/or lane change assist.

In at least one embodiment, vehicle 1500 may further include ultrasonic sensor(s) 1562. In at least one embodiment, ultrasonic sensor(s) 1562, which may be positioned at front, back, and/or sides of vehicle 1500, may be used for park assist and/or to create and update an occupancy grid. In at least one embodiment, a wide variety of ultrasonic sensor(s) 1562 may be used, and different ultrasonic sensor(s) 1562 may be used for different ranges of detection (e.g., 2.5 m, 4 m). In at least one embodiment, ultrasonic sensor(s) 1562 may operate at functional safety levels of ASIL B.

In at least one embodiment, vehicle 1500 may include LIDAR sensor(s) 1564. LIDAR sensor(s) 1564 may be used for object and pedestrian detection, emergency braking, collision avoidance, and/or other functions. In at least one embodiment, LIDAR sensor(s) 1564 may be functional safety level ASIL B. In at least one embodiment, vehicle 1500 may include multiple LIDAR sensors 1564 (e.g., two, four, six, etc.) that may use Ethernet (e.g., to provide data to a Gigabit Ethernet switch).

In at least one embodiment, LIDAR sensor(s) 1564 may be capable of providing a list of objects and their distances for a 360-degree field of view. In at least one embodiment, commercially available LIDAR sensor(s) 1564 may have an advertised range of approximately 100m, with an accuracy of 2 cm-3 cm, and with support for a 100 Mbps Ethernet connection, for example. In at least one embodiment, one or more non-protruding LIDAR sensors 1564 may be used. In such an embodiment, LIDAR sensor(s) 1564 may be implemented as a small device that may be embedded into front, rear, sides, and/or corners of vehicle 1500. In at least one embodiment, LIDAR sensor(s) 1564, in such an embodiment, may provide up to a 120-degree horizontal and 35-degree vertical field-of-view, with a 200 m range even for low-reflectivity objects. In at least one embodiment, front-mounted LIDAR sensor(s) 1564 may be configured for a horizontal field of view between 45 degrees and 135 degrees.

In at least one embodiment, LIDAR technologies, such as 3D flash LIDAR, may also be used. 3D Flash LIDAR uses a flash of a laser as a transmission source, to illuminate surroundings of vehicle 1500 up to approximately 200m. In at least one embodiment, a flash LIDAR unit includes, without limitation, a receptor, which records laser pulse transit time and reflected light on each pixel, which in turn corresponds to range from vehicle 1500 to objects. In at least one embodiment, flash LIDAR may allow for highly accurate and distortion-free images of surroundings to be generated with every laser flash. In at least one embodiment, four flash LIDAR sensors may be deployed, one at each side of vehicle 1500. In at least one embodiment, 3D flash LIDAR systems include, without limitation, a solid-state 3D staring array LIDAR camera with no moving parts other than a fan (e.g., a non-scanning LIDAR device). In at least one embodiment, flash LIDAR device may use a 5 nanosecond class I (eye-safe) laser pulse per frame and may capture reflected laser light in form of 3D range point clouds and co-registered intensity data.

In at least one embodiment, vehicle may further include IMU sensor(s) 1566. In at least one embodiment, IMU sensor(s) 1566 may be located at a center of rear axle of vehicle 1500, in at least one embodiment. In at least one embodiment, IMU sensor(s) 1566 may include, for example and without limitation, accelerometer(s), magnetometer(s), gyroscope(s), magnetic compass(es), and/or other sensor types. In at least one embodiment, such as in six-axis applications, IMU sensor(s) 1566 may include, without limitation, accelerometers and gyroscopes. In at least one embodiment, such as in nine-axis applications, IMU sensor(s) 1566 may include, without limitation, accelerometers, gyroscopes, and magnetometers.

In at least one embodiment, IMU sensor(s) 1566 may be implemented as a miniature, high performance GPS-Aided Inertial Navigation System (“GPS/INS”) that combines micro-electro-mechanical systems (“MEMS”) inertial sensors, a high-sensitivity GPS receiver, and advanced Kalman filtering algorithms to provide estimates of position, velocity, and attitude. In at least one embodiment, IMU sensor(s) 1566 may enable vehicle 1500 to estimate heading without requiring input from a magnetic sensor by directly observing and correlating changes in velocity from GPS to IMU sensor(s) 1566. In at least one embodiment, IMU sensor(s) 1566 and GNSS sensor(s) 1558 may be combined in a single integrated unit.

In at least one embodiment, vehicle 1500 may include microphone(s) 1596 placed in and/or around vehicle 1500. In at least one embodiment, microphone(s) 1596 may be used for emergency vehicle detection and identification, among other things.

In at least one embodiment, vehicle 1500 may further include any number of camera types, including stereo camera(s) 1568, wide-view camera(s) 1570, infrared camera(s) 1572, surround camera(s) 1574, long-range camera(s) 1598, mid-range camera(s) 1576, and/or other camera types. In at least one embodiment, cameras may be used to capture image data around an entire periphery of vehicle 1500. In at least one embodiment, types of cameras used depends vehicle 1500. In at least one embodiment, any combination of camera types may be used to provide necessary coverage around vehicle 1500. In at least one embodiment, number of cameras may differ depending on embodiment. For example, in at least one embodiment, vehicle 1500 could include six cameras, seven cameras, ten cameras, twelve cameras, or another number of cameras. In at least one embodiment, cameras may support, as an example and without limitation, Gigabit Multimedia Serial Link (“GMSL”) and/or Gigabit Ethernet. In at least one embodiment, each of camera(s) is described with more detail previously herein with respect to FIG. 15A and FIG. 15B.

In at least one embodiment, vehicle 1500 may further include vibration sensor(s) 1542. In at least one embodiment, vibration sensor(s) 1542 may measure vibrations of components of vehicle 1500, such as axle(s). For example, in at least one embodiment, changes in vibrations may indicate a change in road surfaces. In at least one embodiment, when two or more vibration sensors 1542 are used, differences between vibrations may be used to determine friction or slippage of road surface (e.g., when difference in vibration is between a power-driven axle and a freely rotating axle).

In at least one embodiment, vehicle 1500 may include ADAS system 1538. ADAS system 1538 may include, without limitation, an SoC, in some examples. In at least one embodiment, ADAS system 1538 may include, without limitation, any number and combination of an autonomous/adaptive/automatic cruise control (“ACC”) system, a cooperative adaptive cruise control (“CACC”) system, a forward crash warning (“FCW”) system, an automatic emergency braking (“AEB”) system, a lane departure warning (“LDW)” system, a lane keep assist (“LKA”) system, a blind spot warning (“BSW”) system, a rear cross-traffic warning (“RCTW”) system, a collision warning (“CW”) system, a lane centering (“LC”) system, and/or other systems, features, and/or functionality.

In at least one embodiment, ACC system may use RADAR sensor(s) 1560, LIDAR sensor(s) 1564, and/or any number of camera(s). In at least one embodiment, ACC system may include a longitudinal ACC system and/or a lateral ACC system. In at least one embodiment, longitudinal ACC system monitors and controls distance to vehicle immediately ahead of vehicle 1500 and automatically adjust speed of vehicle 1500 to maintain a safe distance from vehicles ahead. In at least one embodiment, lateral ACC system performs distance keeping, and advises vehicle 1500 to change lanes when necessary. In at least one embodiment, lateral ACC is related to other ADAS applications such as LC and CW.

In at least one embodiment, CACC system uses information from other vehicles that may be received via network interface 1524 and/or wireless antenna(s) 1526 from other vehicles via a wireless link, or indirectly, over a network connection (e.g., over Internet). In at least one embodiment, direct links may be provided by a vehicle-to-vehicle (“V2V”) communication link, while indirect links may be provided by an infrastructure-to-vehicle (“I2V”) communication link. In general, V2V communication concept provides information about immediately preceding vehicles (e.g., vehicles immediately ahead of and in same lane as vehicle 1500), while I2V communication concept provides information about traffic further ahead. In at least one embodiment, CACC system may include either or both I2V and V2V information sources. In at least one embodiment, given information of vehicles ahead of vehicle 1500, CACC system may be more reliable and it has potential to improve traffic flow smoothness and reduce congestion on road.

In at least one embodiment, FCW system is designed to alert driver to a hazard, so that driver may take corrective action. In at least one embodiment, FCW system uses a front-facing camera and/or RADAR sensor(s) 1560, coupled to a dedicated processor, DSP, FPGA, and/or ASIC, that is electrically coupled to driver feedback, such as a display, speaker, and/or vibrating component. In at least one embodiment, FCW system may provide a warning, such as in form of a sound, visual warning, vibration and/or a quick brake pulse.

In at least one embodiment, AEB system detects an impending forward collision with another vehicle or other object, and may automatically apply brakes if driver does not take corrective action within a specified time or distance parameter. In at least one embodiment, AEB system may use front-facing camera(s) and/or RADAR sensor(s) 1560, coupled to a dedicated processor, DSP, FPGA, and/or ASIC. In at least one embodiment, when AEB system detects a hazard, AEB system typically first alerts driver to take corrective action to avoid collision and, if driver does not take corrective action, AEB system may automatically apply brakes in an effort to prevent, or at least mitigate, impact of predicted collision. In at least one embodiment, AEB system, may include techniques such as dynamic brake support and/or crash imminent braking.

In at least one embodiment, LDW system provides visual, audible, and/or tactile warnings, such as steering wheel or seat vibrations, to alert driver when vehicle 1500 crosses lane markings. In at least one embodiment, LDW system does not activate when driver indicates an intentional lane departure, by activating a turn signal. In at least one embodiment, LDW system may use front-side facing cameras, coupled to a dedicated processor, DSP, FPGA, and/or ASIC, that is electrically coupled to driver feedback, such as a display, speaker, and/or vibrating component. In at least one embodiment, LKA system is a variation of LDW system. LKA system provides steering input or braking to correct vehicle 1500 if vehicle 1500 starts to exit lane.

In at least one embodiment, BSW system detects and warns driver of vehicles in an automobile's blind spot. In at least one embodiment, BSW system may provide a visual, audible, and/or tactile alert to indicate that merging or changing lanes is unsafe. In at least one embodiment, BSW system may provide an additional warning when driver uses a turn signal. In at least one embodiment, BSW system may use rear-side facing camera(s) and/or RADAR sensor(s) 1560, coupled to a dedicated processor, DSP, FPGA, and/or ASIC, that is electrically coupled to driver feedback, such as a display, speaker, and/or vibrating component.

In at least one embodiment, RCTW system may provide visual, audible, and/or tactile notification when an object is detected outside rear-camera range when vehicle 1500 is backing up. In at least one embodiment, RCTW system includes AEB system to ensure that vehicle brakes are applied to avoid a crash. In at least one embodiment, RCTW system may use one or more rear-facing RADAR sensor(s) 1560, coupled to a dedicated processor, DSP, FPGA, and/or ASIC, that is electrically coupled to driver feedback, such as a display, speaker, and/or vibrating component.

In at least one embodiment, conventional ADAS systems may be prone to false positive results which may be annoying and distracting to a driver, but typically are not catastrophic, because conventional ADAS systems alert driver and allow driver to decide whether a safety condition truly exists and act accordingly. In at least one embodiment, vehicle 1500 itself decides, in case of conflicting results, whether to heed result from a primary computer or a secondary computer (e.g., first controller 1536 or second controller 1536). For example, in at least one embodiment, ADAS system 1538 may be a backup and/or secondary computer for providing perception information to a backup computer rationality module. In at least one embodiment, backup computer rationality monitor may run a redundant diverse software on hardware components to detect faults in perception and dynamic driving tasks. In at least one embodiment, outputs from ADAS system 1538 may be provided to a supervisory MCU. In at least one embodiment, if outputs from primary computer and secondary computer conflict, supervisory MCU determines how to reconcile conflict to ensure safe operation.

In at least one embodiment, primary computer may be configured to provide supervisory MCU with a confidence score, indicating primary computer's confidence in chosen result. In at least one embodiment, if confidence score exceeds a threshold, supervisory MCU may follow primary computer's direction, regardless of whether secondary computer provides a conflicting or inconsistent result. In at least one embodiment, where confidence score does not meet threshold, and where primary and secondary computer indicate different results (e.g., a conflict), supervisory MCU may arbitrate between computers to determine appropriate outcome.

In at least one embodiment, supervisory MCU may be configured to run a neural network(s) that is trained and configured to determine, based at least in part on outputs from primary computer and secondary computer, conditions under which secondary computer provides false alarms. In at least one embodiment, neural network(s) in supervisory MCU may learn when secondary computer's output may be trusted, and when it cannot. For example, in at least one embodiment, when secondary computer is a RADAR-based FCW system, a neural network(s) in supervisory MCU may learn when FCW system is identifying metallic objects that are not, in fact, hazards, such as a drainage grate or manhole cover that triggers an alarm. In at least one embodiment, when secondary computer is a camera-based LDW system, a neural network in supervisory MCU may learn to override LDW when bicyclists or pedestrians are present and a lane departure is, in fact, safest maneuver. In at least one embodiment, supervisory MCU may include at least one of a DLA or GPU suitable for running neural network(s) with associated memory. In at least one embodiment, supervisory MCU may comprise and/or be included as a component of SoC(s) 1504.

In at least one embodiment, ADAS system 1538 may include a secondary computer that performs ADAS functionality using traditional rules of computer vision. In at least one embodiment, secondary computer may use classic computer vision rules (if-then), and presence of a neural network(s) in supervisory MCU may improve reliability, safety and performance. For example, in at least one embodiment, diverse implementation and intentional non-identity makes overall system more fault-tolerant, especially to faults caused by software (or software-hardware interface) functionality. For example, in at least one embodiment, if there is a software bug or error in software running on primary computer, and non-identical software code running on secondary computer provides same overall result, then supervisory MCU may have greater confidence that overall result is correct, and bug in software or hardware on primary computer is not causing material error.

In at least one embodiment, output of ADAS system 1538 may be fed into primary computer's perception block and/or primary computer's dynamic driving task block. For example, in at least one embodiment, if ADAS system 1538 indicates a forward crash warning due to an object immediately ahead, perception block may use this information when identifying objects. In at least one embodiment, secondary computer may have its own neural network which is trained and thus reduces risk of false positives, as described herein.

In at least one embodiment, vehicle 1500 may further include infotainment SoC 1530 (e.g., an in-vehicle infotainment system (IVI)). Although illustrated and described as an SoC, infotainment system 1530, in at least one embodiment, may not be an SoC, and may include, without limitation, two or more discrete components. In at least one embodiment, infotainment SoC 1530 may include, without limitation, a combination of hardware and software that may be used to provide audio (e.g., music, a personal digital assistant, navigational instructions, news, radio, etc.), video (e.g., TV, movies, streaming, etc.), phone (e.g., hands-free calling), network connectivity (e.g., LTE, WiFi, etc.), and/or information services (e.g., navigation systems, rear-parking assistance, a radio data system, vehicle related information such as fuel level, total distance covered, brake fuel level, oil level, door open/close, air filter information, etc.) to vehicle 1500. For example, infotainment SoC 1530 could include radios, disk players, navigation systems, video players, USB and Bluetooth connectivity, carputers, in-car entertainment, WiFi, steering wheel audio controls, hands free voice control, a heads-up display (“HUD”), HMI display 1534, a telematics device, a control panel (e.g., for controlling and/or interacting with various components, features, and/or systems), and/or other components. In at least one embodiment, infotainment SoC 1530 may further be used to provide information (e.g., visual and/or audible) to user(s) of vehicle, such as information from ADAS system 1538, autonomous driving information such as planned vehicle maneuvers, trajectories, surrounding environment information (e.g., intersection information, vehicle information, road information, etc.), and/or other information.

In at least one embodiment, infotainment SoC 1530 may include any amount and type of GPU functionality. In at least one embodiment, infotainment SoC 1530 may communicate over bus 1502 (e.g., CAN bus, Ethernet, etc.) with other devices, systems, and/or components of vehicle 1500. In at least one embodiment, infotainment SoC 1530 may be coupled to a supervisory MCU such that GPU of infotainment system may perform some self-driving functions in event that primary controller(s) 1536 (e.g., primary and/or backup computers of vehicle 1500) fail. In at least one embodiment, infotainment SoC 1530 may put vehicle 1500 into a chauffeur to safe stop mode, as described herein.

In at least one embodiment, vehicle 1500 may further include instrument cluster 1532 (e.g., a digital dash, an electronic instrument cluster, a digital instrument panel, etc.). In at least one embodiment, instrument cluster 1532 may include, without limitation, a controller and/or supercomputer (e.g., a discrete controller or supercomputer). In at least one embodiment, instrument cluster 1532 may include, without limitation, any number and combination of a set of instrumentation such as a speedometer, fuel level, oil pressure, tachometer, odometer, turn indicators, gearshift position indicator, seat belt warning light(s), parking-brake warning light(s), engine-malfunction light(s), supplemental restraint system (e.g., airbag) information, lighting controls, safety system controls, navigation information, etc. In some examples, information may be displayed and/or shared among infotainment SoC 1530 and instrument cluster 1532. In at least one embodiment, instrument cluster 1532 may be included as part of infotainment SoC 1530, or vice versa.

In at least one embodiment, at least one component shown or described with respect to FIG. 15C is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, techniques and/or functions described in connection with FIGS. 1-13 may perform rate matching for data received from vehicle 1500 for its autonomous operation, and/or may be used by vehicle 1500 to perform rate matching for data received in connection with its autonomous operation.

FIG. 15D is a diagram of a system 1577 for communication between cloud-based server(s) and autonomous vehicle 1500 of FIG. 15A, according to at least one embodiment. In at least one embodiment, system 1577 may include, without limitation, server(s) 1578, network(s) 1590, and any number and type of vehicles, including vehicle 1500. server(s) 1578 may include, without limitation, a plurality of GPUs 1584(A)-1584(H) (collectively referred to herein as GPUs 1584), PCIe switches 1582(A)-1582(H) (collectively referred to herein as PCIe switches 1582), and/or CPUs 1580(A)-1580(B) (collectively referred to herein as CPUs 1580). GPUs 1584, CPUs 1580, and PCIe switches 1582 may be interconnected with high-speed interconnects such as, for example and without limitation, NVLink interfaces 1588 developed by NVIDIA and/or PCIe connections 1586. In at least one embodiment, GPUs 1584 are connected via an NVLink and/or NVSwitch SoC and GPUs 1584 and PCIe switches 1582 are connected via PCIe interconnects. In at least one embodiment, although eight GPUs 1584, two CPUs 1580, and four PCIe switches 1582 are illustrated, this is not intended to be limiting. In at least one embodiment, each of server(s) 1578 may include, without limitation, any number of GPUs 1584, CPUs 1580, and/or PCIe switches 1582, in any combination. For example, in at least one embodiment, server(s) 1578 could each include eight, sixteen, thirty-two, and/or more GPUs 1584.

In at least one embodiment, server(s) 1578 may receive, over network(s) 1590 and from vehicles, image data representative of images showing unexpected or changed road conditions, such as recently commenced road-work. In at least one embodiment, server(s) 1578 may transmit, over network(s) 1590 and to vehicles, neural networks 1592, updated neural networks 1592, and/or map information 1594, including, without limitation, information regarding traffic and road conditions. In at least one embodiment, updates to map information 1594 may include, without limitation, updates for HD map 1522, such as information regarding construction sites, potholes, detours, flooding, and/or other obstructions. In at least one embodiment, neural networks 1592, updated neural networks 1592, and/or map information 1594 may have resulted from new training and/or experiences represented in data received from any number of vehicles in environment, and/or based at least in part on training performed at a data center (e.g., using server(s) 1578 and/or other servers).

In at least one embodiment, server(s) 1578 may be used to train machine learning models (e.g., neural networks) based at least in part on training data. In at least one embodiment, training data may be generated by vehicles, and/or may be generated in a simulation (e.g., using a game engine). In at least one embodiment, any amount of training data is tagged (e.g., where associated neural network benefits from supervised learning) and/or undergoes other pre-processing. In at least one embodiment, any amount of training data is not tagged and/or pre-processed (e.g., where associated neural network does not require supervised learning). In at least one embodiment, once machine learning models are trained, machine learning models may be used by vehicles (e.g., transmitted to vehicles over network(s) 1590, and/or machine learning models may be used by server(s) 1578 to remotely monitor vehicles.

In at least one embodiment, server(s) 1578 may receive data from vehicles and apply data to up-to-date real-time neural networks for real-time intelligent inferencing. In at least one embodiment, server(s) 1578 may include deep-learning supercomputers and/or dedicated AI computers powered by GPU(s) 1584, such as a DGX and DGX Station machines developed by NVIDIA. However, in at least one embodiment, server(s) 1578 may include deep learning infrastructure that use CPU-powered data centers.

In at least one embodiment, deep-learning infrastructure of server(s) 1578 may be capable of fast, real-time inferencing, and may use that capability to evaluate and verify health of processors, software, and/or associated hardware in vehicle 1500. For example, in at least one embodiment, deep-learning infrastructure may receive periodic updates from vehicle 1500, such as a sequence of images and/or objects that vehicle 1500 has located in that sequence of images (e.g., via computer vision and/or other machine learning object classification techniques). In at least one embodiment, deep-learning infrastructure may run its own neural network to identify objects and compare them with objects identified by vehicle 1500 and, if results do not match and deep-learning infrastructure concludes that AI in vehicle 1500 is malfunctioning, then server(s) 1578 may transmit a signal to vehicle 1500 instructing a fail-safe computer of vehicle 1500 to assume control, notify passengers, and complete a safe parking maneuver.

In at least one embodiment, server(s) 1578 may include GPU(s) 1584 and one or more programmable inference accelerators (e.g., NVIDIA's TensorRT 3). In at least one embodiment, combination of GPU-powered servers and inference acceleration may make real-time responsiveness possible. In at least one embodiment, such as where performance is less critical, servers powered by CPUs, FPGAs, and other processors may be used for inferencing.

Computer Systems

FIG. 16 is a block diagram illustrating an exemplary computer system, which may be a system with interconnected devices and components, a system-on-a-chip (SOC) or some combination thereof 1600 formed with a processor that may include execution units to execute an instruction, according to at least one embodiment. In at least one embodiment, computer system 1600 may include, without limitation, a component, such as a processor 1602 to employ execution units including logic to perform algorithms for process data, in accordance with present disclosure, such as in embodiment described herein. In at least one embodiment, computer system 1600 may include processors, such as PENTIUM® Processor family, Xeon™ Itanium®, XScale™ and/or StrongARM™, Intel® Core™, or Intel® Nervana™ microprocessors available from Intel Corporation of Santa Clara, Calif., although other systems (including PCs having other microprocessors, engineering workstations, set-top boxes and like) may also be used. In at least one embodiment, computer system 1600 may execute a version of WINDOWS' operating system available from Microsoft Corporation of Redmond, Wash., although other operating systems (UNIX and Linux for example), embedded software, and/or graphical user interfaces, may also be used.

Embodiments may be used in other devices such as handheld devices and embedded applications. Some examples of handheld devices include cellular phones, Internet Protocol devices, digital cameras, personal digital assistants (“PDAs”), and handheld PCs. In at least one embodiment, embedded applications may include a microcontroller, a digital signal processor (“DSP”), system on a chip, network computers (“NetPCs”), set-top boxes, network hubs, wide area network (“WAN”) switches, or any other system that may perform one or more instructions in accordance with at least one embodiment.

In at least one embodiment, computer system 1600 may include, without limitation, processor 1602 that may include, without limitation, one or more execution units 1608 to perform machine learning model training and/or inferencing according to techniques described herein. In at least one embodiment, system 16 is a single processor desktop or server system, but in another embodiment system 16 may be a multiprocessor system. In at least one embodiment, processor 1602 may include, without limitation, a complex instruction set computer (“CISC”) microprocessor, a reduced instruction set computing (“RISC”) microprocessor, a very long instruction word (“VLIW”) microprocessor, a processor implementing a combination of instruction sets, or any other processor device, such as a digital signal processor, for example. In at least one embodiment, processor 1602 may be coupled to a processor bus 1610 that may transmit data signals between processor 1602 and other components in computer system 1600.

In at least one embodiment, processor 1602 may include, without limitation, a Level 1 (“L1”) internal cache memory (“cache”) 1604. In at least one embodiment, processor 1602 may have a single internal cache or multiple levels of internal cache. In at least one embodiment, cache memory may reside external to processor 1602. Other embodiments may also include a combination of both internal and external caches depending on particular implementation and needs. In at least one embodiment, register file 1606 may store different types of data in various registers including, without limitation, integer registers, floating point registers, status registers, and instruction pointer register.

In at least one embodiment, execution unit 1608, including, without limitation, logic to perform integer and floating point operations, also resides in processor 1602. In at least one embodiment, processor 1602 may also include a microcode (“ucode”) read only memory (“ROM”) that stores microcode for certain macro instructions. In at least one embodiment, execution unit 1608 may include logic to handle a packed instruction set 1609. In at least one embodiment, by including packed instruction set 1609 in instruction set of a general-purpose processor 1602, along with associated circuitry to execute instructions, operations used by many multimedia applications may be performed using packed data in a general-purpose processor 1602. In one or more embodiments, many multimedia applications may be accelerated and executed more efficiently by using full width of a processor's data bus for performing operations on packed data, which may eliminate need to transfer smaller units of data across processor's data bus to perform one or more operations one data element at a time.

In at least one embodiment, execution unit 1608 may also be used in microcontrollers, embedded processors, graphics devices, DSPs, and other types of logic circuits. In at least one embodiment, computer system 1600 may include, without limitation, a memory 1620. In at least one embodiment, memory 1620 may be implemented as a Dynamic Random Access Memory (“DRAM”) device, a Static Random Access Memory (“SRAM”) device, flash memory device, or other memory device. In at least one embodiment, memory 1620 may store instruction(s) 1619 and/or data 1621 represented by data signals that may be executed by processor 1602.

In at least one embodiment, system logic chip may be coupled to processor bus 1610 and memory 1620. In at least one embodiment, system logic chip may include, without limitation, a memory controller hub (“MCH”) 1616, and processor 1602 may communicate with MCH 1616 via processor bus 1610. In at least one embodiment, MCH 1616 may provide a high bandwidth memory path 1618 to memory 1620 for instruction and data storage and for storage of graphics commands, data and textures. In at least one embodiment, MCH 1616 may direct data signals between processor 1602, memory 1620, and other components in computer system 1600 and to bridge data signals between processor bus 1610, memory 1620, and a system I/O 1622. In at least one embodiment, system logic chip may provide a graphics port for coupling to a graphics controller. In at least one embodiment, MCH 1616 may be coupled to memory 1620 through a high bandwidth memory path 1618 and graphics/video card 1612 may be coupled to MCH 1616 through an Accelerated Graphics Port (“AGP”) interconnect 1614.

In at least one embodiment, computer system 1600 may use system I/O 1622 that is a proprietary hub interface bus to couple MCH 1616 to I/O controller hub (“ICH”) 1630. In at least one embodiment, ICH 1630 may provide direct connections to some I/O devices via a local I/O bus. In at least one embodiment, local I/O bus may include, without limitation, a high-speed I/O bus for connecting peripherals to memory 1620, chipset, and processor 1602. Examples may include, without limitation, an audio controller 1629, a firmware hub (“flash BIOS”) 1628, a wireless transceiver 1626, a data storage 1624, a legacy I/O controller 1623 containing user input and keyboard interfaces, a serial expansion port 1627, such as Universal Serial Bus (“USB”), and a network controller 1634. In at least one embodiment, data storage 1624 may comprise a hard disk drive, a floppy disk drive, a CD-ROM device, a flash memory device, or other mass storage device.

In at least one embodiment, FIG. 16 illustrates a system, which includes interconnected hardware devices or “chips”, whereas in other embodiments, FIG. 16 may illustrate an exemplary System on a Chip (“SoC”). In at least one embodiment, devices illustrated in FIG. 16 may be interconnected with proprietary interconnects, standardized interconnects (e.g., PCIe) or some combination thereof. In at least one embodiment, one or more components of system 1600 are interconnected using compute express link (CXL) interconnects.

In at least one embodiment, at least one component shown or described with respect to FIG. 16 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one of processor 1602 and graphics card 1612 are used to perform are used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one of processor 1602 and graphics card 1612 are used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300. In at least one embodiment, processor 1602 executes a kernel launch function that passes parameters to at least one kernel on graphics card 1612 that performs rate matching described in connection with FIGS. 1-13 .

FIG. 17 is a block diagram illustrating an electronic device 1700 for utilizing a processor 1710, according to at least one embodiment. In at least one embodiment, electronic device 1700 may be, for example and without limitation, a notebook, a tower server, a rack server, a blade server, a laptop, a desktop, a tablet, a mobile device, a phone, an embedded computer, or any other suitable electronic device.

In at least one embodiment, system 1700 may include, without limitation, processor 1710 communicatively coupled to any suitable number or kind of components, peripherals, modules, or devices. In at least one embodiment, processor 1710 coupled using a bus or interface, such as a 1° C. bus, a System Management Bus (“SMBus”), a Low Pin Count (LPC) bus, a Serial Peripheral Interface (“SPI”), a High Definition Audio (“HDA”) bus, a Serial Advance Technology Attachment (“SATA”) bus, a Universal Serial Bus (“USB”) (versions 1, 2, 3), or a Universal Asynchronous Receiver/Transmitter (“UART”) bus. In at least one embodiment, FIG. 17 illustrates a system, which includes interconnected hardware devices or “chips”, whereas in other embodiments, FIG. 17 may illustrate an exemplary System on a Chip (“SoC”). In at least one embodiment, devices illustrated in FIG. 17 may be interconnected with proprietary interconnects, standardized interconnects (e.g., PCIe) or some combination thereof. In at least one embodiment, one or more components of FIG. 17 are interconnected using compute express link (CXL) interconnects.

In at least one embodiment, FIG. 17 may include a display 1724, a touch screen 1725, a touch pad 1730, a Near Field Communications unit (“NFC”) 1745, a sensor hub 1740, a thermal sensor 1746, an Express Chipset (“EC”) 1735, a Trusted Platform Module (“TPM”) 1738, BIOS/firmware/flash memory (“BIOS, FW Flash”) 1722, a DSP 1760, a drive “SSD or HDD”) 1720 such as a Solid State Disk (“SSD”) or a Hard Disk Drive (“HDD”), a wireless local area network unit (“WLAN”) 1750, a Bluetooth unit 1752, a Wireless Wide Area Network unit (“WWAN”) 1756, a Global Positioning System (GPS) 1755, a camera (“USB 3.0 camera”) 1754 such as a USB 3.0 camera, or a Low Power Double Data Rate (“LPDDR”) memory unit (“LPDDR3”) 1715 implemented in, for example, LPDDR3 standard. These components may each be implemented in any suitable manner.

In at least one embodiment, other components may be communicatively coupled to processor 1710 through components discussed above. In at least one embodiment, an accelerometer 1741, Ambient Light Sensor (“ALS”) 1742, compass 1743, and a gyroscope 1744 may be communicatively coupled to sensor hub 1740. In at least one embodiment, thermal sensor 1739, a fan 1737, a keyboard 1746, and a touch pad 1730 may be communicatively coupled to EC 1735. In at least one embodiment, speaker 1763, a headphones 1764, and a microphone (“mic”) 1765 may be communicatively coupled to an audio unit (“audio codec and class d amp”) 1764, which may in turn be communicatively coupled to DSP 1760. In at least one embodiment, audio unit 1764 may include, for example and without limitation, an audio coder/decoder (“codec”) and a class D amplifier. In at least one embodiment, SIM card (“SIM”) 1757 may be communicatively coupled to WWAN unit 1756. In at least one embodiment, components such as WLAN unit 1750 and Bluetooth unit 1752, as well as WWAN unit 1756 may be implemented in a Next Generation Form Factor (“NGFF”).

In at least one embodiment, at least one component shown or described with respect to FIG. 17 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one of processor 1710 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, processor 1710 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 18 illustrates a computer system 1800, according to at least one embodiment. In at least one embodiment, computer system 1800 is configured to implement various processes and methods described throughout this disclosure.

In at least one embodiment, computer system 1800 comprises, without limitation, at least one central processing unit (“CPU”) 1802 that is connected to a communication bus 1810 implemented using any suitable protocol, such as PCI (“Peripheral Component Interconnect”), peripheral component interconnect express (“PCI-Express”), AGP (“Accelerated Graphics Port”), HyperTransport, or any other bus or point-to-point communication protocol(s). In at least one embodiment, computer system 1800 includes, without limitation, a main memory 1804 and control logic (e.g., implemented as hardware, software, or a combination thereof) and data are stored in main memory 1804 which may take form of random access memory (“RAM”). In at least one embodiment, a network interface subsystem (“network interface”) 1822 provides an interface to other computing devices and networks for receiving data from and transmitting data to other systems from computer system 1800.

In at least one embodiment, computer system 1800, in at least one embodiment, includes, without limitation, input devices 1808, parallel processing system 1812, and display devices 1806 which can be implemented using a conventional cathode ray tube (“CRT”), liquid crystal display (“LCD”), light emitting diode (“LED”), plasma display, or other suitable display technologies. In at least one embodiment, user input is received from input devices 1808 such as keyboard, mouse, touchpad, microphone, and more. In at least one embodiment, each of foregoing modules can be situated on a single semiconductor platform to form a processing system.

In at least one embodiment, at least one component shown or described with respect to FIG. 18 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one of parallel processing system 1812 and CPU 1802 are used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one of parallel processing system 1812 and CPU 1802 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300. In at least one embodiment, CPU 1802 executes a kernel launch function that passes parameters to at least one kernel on PPUs 1814 that performs rate matching described in connection with FIGS. 1-13 .

FIG. 19 illustrates a computer system 1900, according to at least one embodiment. In at least one embodiment, computer system 1900 includes, without limitation, a computer 1910 and a USB stick 1920. In at least one embodiment, computer 1910 may include, without limitation, any number and type of processor(s) (not shown) and a memory (not shown). In at least one embodiment, computer 1910 includes, without limitation, a server, a cloud instance, a laptop, and a desktop computer.

In at least one embodiment, USB stick 1920 includes, without limitation, a processing unit 1930, a USB interface 1940, and USB interface logic 1950. In at least one embodiment, processing unit 1930 may be any instruction execution system, apparatus, or device capable of executing instructions. In at least one embodiment, processing unit 1930 may include, without limitation, any number and type of processing cores (not shown). In at least one embodiment, processing core 1930 comprises an application specific integrated circuit (“ASIC”) that is optimized to perform any amount and type of operations associated with machine learning. For instance, in at least one embodiment, processing core 1930 is a tensor processing unit (“TPC”) that is optimized to perform machine learning inference operations. In at least one embodiment, processing core 1930 is a vision processing unit (“VPU”) that is optimized to perform machine vision and machine learning inference operations.

In at least one embodiment, USB interface 1940 may be any type of USB connector or USB socket. For instance, in at least one embodiment, USB interface 1940 is a USB 3.0 Type-C socket for data and power. In at least one embodiment, USB interface 1940 is a USB 3.0 Type-A connector. In at least one embodiment, USB interface logic 1950 may include any amount and type of logic that enables processing unit 1930 to interface with or devices (e.g., computer 1910) via USB connector 1940.

In at least one embodiment, at least one component shown or described with respect to FIG. 19 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, computer 1910 are used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, computer 1910 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300..

FIG. 20A illustrates an exemplary architecture in which a plurality of GPUs 2010-2013 is communicatively coupled to a plurality of multi-core processors 2005-2006 over high-speed links 2040-2043 (e.g., buses, point-to-point interconnects, etc.). In one embodiment, high-speed links 2040-2043 support a communication throughput of 4 GB/s, 30 GB/s, 80 GB/s or higher. Various interconnect protocols may be used including, but not limited to, PCIe 4.0 or 5.0 and NVLink 2.0.

In addition, and in one embodiment, two or more of GPUs 2010-2013 are interconnected over high-speed links 2029-2030, which may be implemented using same or different protocols/links than those used for high-speed links 2040-2043. Similarly, two or more of multi-core processors 2005-2006 may be connected over high speed link 2028 which may be symmetric multi-processor (SMP) buses operating at 20 GB/s, 30 GB/s, 120 GB/s or higher. Alternatively, all communication between various system components shown in FIG. 20A may be accomplished using same protocols/links (e.g., over a common interconnection fabric).

In one embodiment, each multi-core processor 2005-2006 is communicatively coupled to a processor memory 2001-2002, via memory interconnects 2026-2027, respectively, and each GPU 2010-2013 is communicatively coupled to GPU memory 2020-2023 over GPU memory interconnects 2050-2053, respectively. Memory interconnects 2026-2027 and 2050-2053 may utilize same or different memory access technologies. By way of example, and not limitation, processor memories 2001-2002 and GPU memories 2020-2023 may be volatile memories such as dynamic random access memories (DRAMs) (including stacked DRAMs), Graphics DDR SDRAM (GDDR) (e.g., GDDR5, GDDR6), or High Bandwidth Memory (HBM) and/or may be non-volatile memories such as 3D XPoint or Nano-Ram. In one embodiment, some portion of processor memories 2001-2002 may be volatile memory and another portion may be non-volatile memory (e.g., using a two-level memory (2LM) hierarchy).

As described herein, although various processors 2005-2006 and GPUs 2010-2013 may be physically coupled to a particular memory 2001-2002, 2020-2023, respectively, a unified memory architecture may be implemented in which a same virtual system address space (also referred to as “effective address” space) is distributed among various physical memories. For example, processor memories 2001-2002 may each comprise 64 GB of system memory address space and GPU memories 2020-2023 may each comprise 32 GB of system memory address space (resulting in a total of 256 GB addressable memory in this example).

FIG. 20B illustrates additional details for an interconnection between a multi-core processor 2007 and a graphics acceleration module 2046 in accordance with one exemplary embodiment. Graphics acceleration module 2046 may include one or more GPU chips integrated on a line card which is coupled to processor 2007 via high-speed link 2040. Alternatively, graphics acceleration module 2046 may be integrated on a same package or chip as processor 2007.

In at least one embodiment, illustrated processor 2007 includes a plurality of cores 2060A-2060D, each with a translation lookaside buffer 2061A-2061D and one or more caches 2062A-2062D. In at least one embodiment, cores 2060A-2060D may include various other components for executing instructions and processing data which are not illustrated. Caches 2062A-2062D may comprise level 1 (L1) and level 2 (L2) caches. In addition, one or more shared caches 2056 may be included in caches 2062A-2062D and shared by sets of cores 2060A-2060D. For example, one embodiment of processor 2007 includes 24 cores, each with its own L1 cache, twelve shared L2 caches, and twelve shared L3 caches. In this embodiment, one or more L2 and L3 caches are shared by two adjacent cores. Processor 2007 and graphics acceleration module 2046 connect with system memory 2014, which may include processor memories 2001-2002 of FIG. 20A.

Coherency is maintained for data and instructions stored in various caches 2062A-2062D, 2056 and system memory 2014 via inter-core communication over a coherence bus 2064. For example, each cache may have cache coherency logic/circuitry associated therewith to communicate to over coherence bus 2064 in response to detected reads or writes to particular cache lines. In one implementation, a cache snooping protocol is implemented over coherence bus 2064 to snoop cache accesses.

In one embodiment, a proxy circuit 2025 communicatively couples graphics acceleration module 2046 to coherence bus 2064, allowing graphics acceleration module 2046 to participate in a cache coherence protocol as a peer of cores 2060A-2060D. In particular, an interface 2035 provides connectivity to proxy circuit 2025 over high-speed link 2040 (e.g., a PCIe bus, NVLink, etc.) and an interface 2037 connects graphics acceleration module 2046 to link 2040.

In one implementation, an accelerator integration circuit 2036 provides cache management, memory access, context management, and interrupt management services on behalf of a plurality of graphics processing engines 2031, 2032, N of graphics acceleration module 2046. Graphics processing engines 2031, 2032, N may each comprise a separate graphics processing unit (GPU). Alternatively, graphics processing engines 2031, 2032, N may comprise different types of graphics processing engines within a GPU such as graphics execution units, media processing engines (e.g., video encoders/decoders), samplers, and blit engines. In at least one embodiment, graphics acceleration module 2046 may be a GPU with a plurality of graphics processing engines 2031-2032, N or graphics processing engines 2031-2032, N may be individual GPUs integrated on a common package, line card, or chip.

In one embodiment, accelerator integration circuit 2036 includes a memory management unit (MMU) 2039 for performing various memory management functions such as virtual-to-physical memory translations (also referred to as effective-to-real memory translations) and memory access protocols for accessing system memory 2014. MMU 2039 may also include a translation lookaside buffer (TLB) (not shown) for caching virtual/effective to physical/real address translations. In one implementation, a cache 2038 stores commands and data for efficient access by graphics processing engines 2031-2032, N. In one embodiment, data stored in cache 2038 and graphics memories 2033-2034, M is kept coherent with core caches 2062A-2062D, 2056 and system memory 2014. As mentioned, this may be accomplished via proxy circuit 2025 on behalf of cache 2038 and memories 2033-2034, M (e.g., sending updates to cache 2038 related to modifications/accesses of cache lines on processor caches 2062A-2062D, 2056 and receiving updates from cache 2038).

A set of registers 2045 store context data for threads executed by graphics processing engines 2031-2032, N and a context management circuit 2048 manages thread contexts. For example, context management circuit 2048 may perform save and restore operations to save and restore contexts of various threads during contexts switches (e.g., where a first thread is saved and a second thread is stored so that a second thread can be execute by a graphics processing engine). For example, on a context switch, context management circuit 2048 may store current register values to a designated region in memory (e.g., identified by a context pointer). It may then restore register values when returning to a context. In one embodiment, an interrupt management circuit 2047 receives and processes interrupts received from system devices.

In one implementation, virtual/effective addresses from a graphics processing engine 2031 are translated to real/physical addresses in system memory 2014 by MMU 2039. One embodiment of accelerator integration circuit 2036 supports multiple (e.g., 4, 8, 16) graphics accelerator modules 2046 and/or other accelerator devices. Graphics accelerator module 2046 may be dedicated to a single application executed on processor 2007 or may be shared between multiple applications. In one embodiment, a virtualized graphics execution environment is presented in which resources of graphics processing engines 2031-2032, N are shared with multiple applications or virtual machines (VMs). In at least one embodiment, resources may be subdivided into “slices” which are allocated to different VMs and/or applications based on processing requirements and priorities associated with VMs and/or applications.

In at least one embodiment, accelerator integration circuit 2036 performs as a bridge to a system for graphics acceleration module 2046 and provides address translation and system memory cache services. In addition, accelerator integration circuit 2036 may provide virtualization facilities for a host processor to manage virtualization of graphics processing engines 2031-2032, interrupts, and memory management.

Because hardware resources of graphics processing engines 2031-2032, N are mapped explicitly to a real address space seen by host processor 2007, any host processor can address these resources directly using an effective address value. One function of accelerator integration circuit 2036, in one embodiment, is physical separation of graphics processing engines 2031-2032, N so that they appear to a system as independent units.

In at least one embodiment, one or more graphics memories 2033-2034, M are coupled to each of graphics processing engines 2031-2032, N, respectively. Graphics memories 2033-2034, M store instructions and data being processed by each of graphics processing engines 2031-2032, N. Graphics memories 2033-2034, M may be volatile memories such as DRAMs (including stacked DRAMs), GDDR memory (e.g., GDDR5, GDDR6), or HBM, and/or may be non-volatile memories such as 3D XPoint or Nano-Ram.

In one embodiment, to reduce data traffic over link 2040, biasing techniques are used to ensure that data stored in graphics memories 2033-2034, M is data which will be used most frequently by graphics processing engines 2031-2032, N and preferably not used by cores 2060A-2060D (at least not frequently). Similarly, a biasing mechanism attempts to keep data needed by cores (and preferably not graphics processing engines 2031-2032, N) within caches 2062A-2062D, 2056 of cores and system memory 2014.

FIG. 20C illustrates another exemplary embodiment in which accelerator integration circuit 2036 is integrated within processor 2007. In this embodiment, graphics processing engines 2031-2032, N communicate directly over high-speed link 2040 to accelerator integration circuit 2036 via interface 2037 and interface 2035 (which, again, may be utilize any form of bus or interface protocol). Accelerator integration circuit 2036 may perform same operations as those described with respect to FIG. 20B, but potentially at a higher throughput given its close proximity to coherence bus 2064 and caches 2062A-2062D, 2056. One embodiment supports different programming models including a dedicated-process programming model (no graphics acceleration module virtualization) and shared programming models (with virtualization), which may include programming models which are controlled by accelerator integration circuit 2036 and programming models which are controlled by graphics acceleration module 2046.

In at least one embodiment, graphics processing engines 2031-2032, N are dedicated to a single application or process under a single operating system. In at least one embodiment, a single application can funnel other application requests to graphics processing engines 2031-2032, N, providing virtualization within a VM/partition.

In at least one embodiment, graphics processing engines 2031-2032, N, may be shared by multiple VM/application partitions. In at least one embodiment, shared models may use a system hypervisor to virtualize graphics processing engines 2031-2032, N to allow access by each operating system. For single-partition systems without a hypervisor, graphics processing engines 2031-2032, N are owned by an operating system. In at least one embodiment, an operating system can virtualize graphics processing engines 2031-2032, N to provide access to each process or application.

In at least one embodiment, graphics acceleration module 2046 or an individual graphics processing engine 2031-2032, N selects a process element using a process handle. In one embodiment, process elements are stored in system memory 2014 and are addressable using an effective address to real address translation techniques described herein. In at least one embodiment, a process handle may be an implementation-specific value provided to a host process when registering its context with graphics processing engine 2031-2032, N (that is, calling system software to add a process element to a process element linked list). In at least one embodiment, a lower 16-bits of a process handle may be an offset of the process element within a process element linked list.

FIG. 20D illustrates an exemplary accelerator integration slice 2090. As used herein, a “slice” comprises a specified portion of processing resources of accelerator integration circuit 2036. Application effective address space 2082 within system memory 2014 stores process elements 2083. In one embodiment, process elements 2083 are stored in response to GPU invocations 2081 from applications 2080 executed on processor 2007. A process element 2083 contains process state for corresponding application 2080. A work descriptor (WD) 2084 contained in process element 2083 can be a single job requested by an application or may contain a pointer to a queue of jobs. In at least one embodiment, WD 2084 is a pointer to a job request queue in an application's address space 2082.

Graphics acceleration module 2046 and/or individual graphics processing engines 2031-2032, N can be shared by all or a subset of processes in a system. In at least one embodiment, an infrastructure for setting up process state and sending a WD 2084 to a graphics acceleration module 2046 to start a job in a virtualized environment may be included.

In at least one embodiment, a dedicated-process programming model is implementation-specific. In this model, a single process owns graphics acceleration module 2046 or an individual graphics processing engine 2031. Because graphics acceleration module 2046 is owned by a single process, a hypervisor initializes accelerator integration circuit 2036 for an owning partition and an operating system initializes accelerator integration circuit 2036 for an owning process when graphics acceleration module 2046 is assigned.

In operation, a WD fetch unit 2091 in accelerator integration slice 2090 fetches next WD 2084 which includes an indication of work to be done by one or more graphics processing engines of graphics acceleration module 2046. Data from WD 2084 may be stored in registers 2045 and used by MMU 2039, interrupt management circuit 2047 and/or context management circuit 2048 as illustrated. For example, one embodiment of MMU 2039 includes segment/page walk circuitry for accessing segment/page tables 2086 within OS virtual address space 2085. Interrupt management circuit 2047 may process interrupt events 2092 received from graphics acceleration module 2046. When performing graphics operations, an effective address 2093 generated by a graphics processing engine 2031-2032, N is translated to a real address by MMU 2039.

In one embodiment, a same set of registers 2045 are duplicated for each graphics processing engine 2031-2032, N and/or graphics acceleration module 2046 and may be initialized by a hypervisor or operating system. Each of these duplicated registers may be included in an accelerator integration slice 2090. Exemplary registers that may be initialized by a hypervisor are shown in Table 1.

TABLE 1 Hypervisor Initialized Registers 1 Slice Control Register 2 Real Address (RA) Scheduled Processes Area Pointer 3 Authority Mask Override Register 4 Interrupt Vector Table Entry Offset 5 Interrupt Vector Table Entry Limit 6 State Register 7 Logical Partition ID 8 Real address (RA) Hypervisor Accelerator Utilization Record Pointer 9 Storage Description Register

Exemplary registers that may be initialized by an operating system are shown in Table 2.

TABLE 2 Operating System Initialized Registers 1 Process and Thread Identification 2 Effective Address (EA) Context Save/Restore Pointer 3 Virtual Address (VA) Accelerator Utilization Record Pointer 4 Virtual Address (VA) Storage Segment Table Pointer 5 Authority Mask 6 Work descriptor

In one embodiment, each WD 2084 is specific to a particular graphics acceleration module 2046 and/or graphics processing engines 2031-2032, N. It contains all information required by a graphics processing engine 2031-2032, N to do work or it can be a pointer to a memory location where an application has set up a command queue of work to be completed.

FIG. 20E illustrates additional details for one exemplary embodiment of a shared model. This embodiment includes a hypervisor real address space 2098 in which a process element list 2099 is stored. Hypervisor real address space 2098 is accessible via a hypervisor 2096 which virtualizes graphics acceleration module engines for operating system 2095.

In at least one embodiment, shared programming models allow for all or a subset of processes from all or a subset of partitions in a system to use a graphics acceleration module 2046. There are two programming models where graphics acceleration module 2046 is shared by multiple processes and partitions: time-sliced shared and graphics directed shared.

In this model, system hypervisor 2096 owns graphics acceleration module 2046 and makes its function available to all operating systems 2095. For a graphics acceleration module 2046 to support virtualization by system hypervisor 2096, graphics acceleration module 2046 may adhere to the following: 1) An application's job request must be autonomous (that is, state does not need to be maintained between jobs), or graphics acceleration module 2046 must provide a context save and restore mechanism. 2) An application's job request is guaranteed by graphics acceleration module 2046 to complete in a specified amount of time, including any translation faults, or graphics acceleration module 2046 provides an ability to preempt processing of a job. 3) Graphics acceleration module 2046 must be guaranteed fairness between processes when operating in a directed shared programming model.

In at least one embodiment, application 2080 is required to make an operating system 2095 system call with a graphics acceleration module 2046 type, a work descriptor (WD), an authority mask register (AMR) value, and a context save/restore area pointer (CSRP). In at least one embodiment, graphics acceleration module 2046 type describes a targeted acceleration function for a system call. In at least one embodiment, graphics acceleration module 2046 type may be a system-specific value. In at least one embodiment, WD is formatted specifically for graphics acceleration module 2046 and can be in a form of a graphics acceleration module 2046 command, an effective address pointer to a user-defined structure, an effective address pointer to a queue of commands, or any other data structure to describe work to be done by graphics acceleration module 2046. In one embodiment, an AMR value is an AMR state to use for a current process. In at least one embodiment, a value passed to an operating system is similar to an application setting an AMR. If accelerator integration circuit 2036 and graphics acceleration module 2046 implementations do not support a User Authority Mask Override Register (UAMOR), an operating system may apply a current UAMOR value to an AMR value before passing an AMR in a hypervisor call. Hypervisor 2096 may optionally apply a current Authority Mask Override Register (AMOR) value before placing an AMR into process element 2083. In at least one embodiment, CSRP is one of registers 2045 containing an effective address of an area in an application's address space 2082 for graphics acceleration module 2046 to save and restore context state. This pointer is optional if no state is required to be saved between jobs or when a job is preempted. In at least one embodiment, context save/restore area may be pinned system memory.

Upon receiving a system call, operating system 2095 may verify that application 2080 has registered and been given authority to use graphics acceleration module 2046. Operating system 2095 then calls hypervisor 2096 with information shown in Table 3.

TABLE 3 OS to Hypervisor Call Parameters 1 A work descriptor (WD) 2 An Authority Mask Register (AMR) value (potentially masked) 3 An effective address (EA) Context Save/Restore Area Pointer (CSRP) 4 A process ID (PID) and optional thread ID (TID) 5 A virtual address (VA) accelerator utilization record pointer (AURP) 6 Virtual address of storage segment table pointer (SSTP) 7 A logical interrupt service number (LISN)

Upon receiving a hypervisor call, hypervisor 2096 verifies that operating system 2095 has registered and been given authority to use graphics acceleration module 2046. Hypervisor 2096 then puts process element 2083 into a process element linked list for a corresponding graphics acceleration module 2046 type. A process element may include information shown in Table 4.

TABLE 4 Process Element Information  1 A work descriptor (WD)  2 An Authority Mask Register (AMR) value (potentially masked).  3 An effective address (EA) Context Save/Restore Area Pointer (CSRP)  4 A process ID (PID) and optional thread ID (TID)  5 A virtual address (VA) accelerator utilization record pointer (AURP)  6 Virtual address of storage segment table pointer (SSTP)  7 A logical interrupt service number (LISN)  8 Interrupt vector table, derived from hypervisor call parameters  9 A state register (SR) value 10 A logical partition ID (LPID) 11 A real address (RA) hypervisor accelerator utilization record pointer 12 Storage Descriptor Register (SDR)

In at least one embodiment, hypervisor initializes a plurality of accelerator integration slice 2090 registers 2045.

As illustrated in FIG. 20F, in at least one embodiment, a unified memory is used, addressable via a common virtual memory address space used to access physical processor memories 2001-2002 and GPU memories 2020-2023. In this implementation, operations executed on GPUs 2010-2013 utilize a same virtual/effective memory address space to access processor memories 2001-2002 and vice versa, thereby simplifying programmability. In one embodiment, a first portion of a virtual/effective address space is allocated to processor memory 2001, a second portion to second processor memory 2002, a third portion to GPU memory 2020, and so on. In at least one embodiment, an entire virtual/effective memory space (sometimes referred to as an effective address space) is thereby distributed across each of processor memories 2001-2002 and GPU memories 2020-2023, allowing any processor or GPU to access any physical memory with a virtual address mapped to that memory.

In one embodiment, bias/coherence management circuitry 2094A-2094E within one or more of MMUs 2039A-2039E ensures cache coherence between caches of one or more host processors (e.g., 2005) and GPUs 2010-2013 and implements biasing techniques indicating physical memories in which certain types of data should be stored. While multiple instances of bias/coherence management circuitry 2094A-2094E are illustrated in FIG. 20F, bias/coherence circuitry may be implemented within an MMU of one or more host processors 2005 and/or within accelerator integration circuit 2036.

One embodiment allows GPU-attached memory 2020-2023 to be mapped as part of system memory, and accessed using shared virtual memory (SVM) technology, but without suffering performance drawbacks associated with full system cache coherence. In at least one embodiment, an ability for GPU-attached memory 2020-2023 to be accessed as system memory without onerous cache coherence overhead provides a beneficial operating environment for GPU offload. This arrangement allows host processor 2005 software to setup operands and access computation results, without overhead of tradition I/O DMA data copies. Such traditional copies involve driver calls, interrupts and memory mapped I/O (MMIO) accesses that are all inefficient relative to simple memory accesses. In at least one embodiment, an ability to access GPU attached memory 2020-2023 without cache coherence overheads can be critical to execution time of an offloaded computation. In cases with substantial streaming write memory traffic, for example, cache coherence overhead can significantly reduce an effective write bandwidth seen by a GPU 2010-2013. In at least one embodiment, efficiency of operand setup, efficiency of results access, and efficiency of GPU computation may play a role in determining effectiveness of a GPU offload.

In at least one embodiment, selection of GPU bias and host processor bias is driven by a bias tracker data structure. A bias table may be used, for example, which may be a page-granular structure (i.e., controlled at a granularity of a memory page) that includes 1 or 2 bits per GPU-attached memory page. In at least one embodiment, a bias table may be implemented in a stolen memory range of one or more GPU-attached memories 2020-2023, with or without a bias cache in GPU 2010-2013 (eg. to cache frequently/recently used entries of a bias table). Alternatively, an entire bias table may be maintained within a GPU.

In at least one embodiment, a bias table entry associated with each access to GPU-attached memory 2020-2023 is accessed prior to actual access to a GPU memory, causing the following operations. First, local requests from GPU 2010-2013 that find their page in GPU bias are forwarded directly to a corresponding GPU memory 2020-2023. Local requests from a GPU that find their page in host bias are forwarded to processor 2005 (e.g., over a high-speed link as discussed above). In one embodiment, requests from processor 2005 that find a requested page in host processor bias complete a request like a normal memory read. Alternatively, requests directed to a GPU-biased page may be forwarded to GPU 2010-2013. In at least one embodiment, a GPU may then transition a page to a host processor bias if it is not currently using a page. In at least one embodiment, bias state of a page can be changed either by a software-based mechanism, a hardware-assisted software-based mechanism, or, for a limited set of cases, a purely hardware-based mechanism.

One mechanism for changing bias state employs an API call (e.g. OpenCL), which, in turn, calls a GPU's device driver which, in turn, sends a message (or enqueues a command descriptor) to a GPU directing it to change a bias state and, for some transitions, perform a cache flushing operation in a host. In at least one embodiment, cache flushing operation is used for a transition from host processor 2005 bias to GPU bias, but is not for an opposite transition.

In one embodiment, cache coherency is maintained by temporarily rendering GPU-biased pages uncacheable by host processor 2005. To access these pages, processor 2005 may request access from GPU 2010 which may or may not grant access right away. Thus, to reduce communication between processor 2005 and GPU 2010 it is beneficial to ensure that GPU-biased pages are those which are required by a GPU but not host processor 2005 and vice versa.

In at least one embodiment, at least one component shown or described with respect to FIG. 20A-F is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one GPU and/or multi-core processor shown or described with respect to FIGS. 20A-F is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one GPU and/or multi-core processor shown or described with respect to FIGS. 20A-F is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300. In at least one embodiment, a multi-core processor, such as multi-core processor 2005 executes a kernel launch function that passes parameters to at least one kernel on a graphics processor, such as GPU 2010 that performs rate matching described in connection with FIGS. 1-13 .

FIG. 21 illustrates exemplary integrated circuits and associated graphics processors that may be fabricated using one or more IP cores, according to various embodiments described herein. In addition to what is illustrated, other logic and circuits may be included in at least one embodiment, including additional graphics processors/cores, peripheral interface controllers, or general-purpose processor cores.

FIG. 21 is a block diagram illustrating an exemplary system on a chip integrated circuit 2100 that may be fabricated using one or more IP cores, according to at least one embodiment. In at least one embodiment, integrated circuit 2100 includes one or more application processor(s) 2105 (e.g., CPUs), at least one graphics processor 2110, and may additionally include an image processor 2115 and/or a video processor 2120, any of which may be a modular IP core. In at least one embodiment, integrated circuit 2100 includes peripheral or bus logic including a USB controller 2125, UART controller 2130, an SPI/SDIO controller 2135, and an I.sup.2S/I.sup.2C controller 2140. In at least one embodiment, integrated circuit 2100 can include a display device 2145 coupled to one or more of a high-definition multimedia interface (HDMI) controller 2150 and a mobile industry processor interface (MIPI) display interface 2155. In at least one embodiment, storage may be provided by a flash memory subsystem 2160 including flash memory and a flash memory controller. In at least one embodiment, memory interface may be provided via a memory controller 2165 for access to SDRAM or SRAM memory devices. In at least one embodiment, some integrated circuits additionally include an embedded security engine 2170.

In at least one embodiment, at least one component shown or described with respect to FIG. 21 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, graphics processor 2110 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, graphics processor 2110 used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIGS. 22A-22B illustrate exemplary integrated circuits and associated graphics processors that may be fabricated using one or more IP cores, according to various embodiments described herein. In addition to what is illustrated, other logic and circuits may be included in at least one embodiment, including additional graphics processors/cores, peripheral interface controllers, or general-purpose processor cores.

FIGS. 22A-22B are block diagrams illustrating exemplary graphics processors for use within an SoC, according to embodiments described herein. FIG. 22A illustrates an exemplary graphics processor 2210 of a system on a chip integrated circuit that may be fabricated using one or more IP cores, according to at least one embodiment. FIG. 22B illustrates an additional exemplary graphics processor 2240 of a system on a chip integrated circuit that may be fabricated using one or more IP cores, according to at least one embodiment. In at least one embodiment, graphics processor 2210 of FIG. 22A is a low power graphics processor core. In at least one embodiment, graphics processor 2240 of FIG. 22B is a higher performance graphics processor core. In at least one embodiment, each of graphics processors 2210, 2240 can be variants of graphics processor 2110 of FIG. 21 .

In at least one embodiment, graphics processor 2210 includes a vertex processor 2205 and one or more fragment processor(s) 2215A-2215N (e.g., 2215A, 2215B, 2215C, 2215D, through 2215N-1, and 2215N). In at least one embodiment, graphics processor 2210 can execute different shader programs via separate logic, such that vertex processor 2205 is optimized to execute operations for vertex shader programs, while one or more fragment processor(s) 2215A-2215N execute fragment (e.g., pixel) shading operations for fragment or pixel shader programs. In at least one embodiment, vertex processor 2205 performs a vertex processing stage of a 3D graphics pipeline and generates primitives and vertex data. In at least one embodiment, fragment processor(s) 2215A-2215N use primitive and vertex data generated by vertex processor 2205 to produce a framebuffer that is displayed on a display device. In at least one embodiment, fragment processor(s) 2215A-2215N are optimized to execute fragment shader programs as provided for in an OpenGL API, which may be used to perform similar operations as a pixel shader program as provided for in a Direct 3D API.

In at least one embodiment, graphics processor 2210 additionally includes one or more memory management units (MMUs) 2220A-2220B, cache(s) 2225A-2225B, and circuit interconnect(s) 2230A-2230B. In at least one embodiment, one or more MMU(s) 2220A-2220B provide for virtual to physical address mapping for graphics processor 2210, including for vertex processor 2205 and/or fragment processor(s) 2215A-2215N, which may reference vertex or image/texture data stored in memory, in addition to vertex or image/texture data stored in one or more cache(s) 2225A-2225B. In at least one embodiment, one or more MMU(s) 2220A-2220B may be synchronized with other MMUs within system, including one or more MMUs associated with one or more application processor(s) 2105, image processors 2115, and/or video processors 2120 of FIG. 21 , such that each processor 2105-2120 can participate in a shared or unified virtual memory system. In at least one embodiment, one or more circuit interconnect(s) 2230A-2230B enable graphics processor 2210 to interface with other IP cores within SoC, either via an internal bus of SoC or via a direct connection.

In at least one embodiment, graphics processor 2240 includes one or more MMU(s) 2220A-2220B, caches 2225A-2225B, and circuit interconnects 2230A-2230B of graphics processor 2210 of FIG. 22A. In at least one embodiment, graphics processor 2240 includes one or more shader core(s) 2255A-2255N (e.g., 2255A, 2255B, 2255C, 2255D, 2255E, 2255F, through 2255N-1, and 2255N), which provides for a unified shader core architecture in which a single core or type or core can execute all types of programmable shader code, including shader program code to implement vertex shaders, fragment shaders, and/or compute shaders. In at least one embodiment, a number of shader cores can vary. In at least one embodiment, graphics processor 2240 includes an inter-core task manager 2245, which acts as a thread dispatcher to dispatch execution threads to one or more shader cores 2255A-2255N and a tiling unit 2258 to accelerate tiling operations for tile-based rendering, in which rendering operations for a scene are subdivided in image space, for example to exploit local spatial coherence within a scene or to optimize use of internal caches.

In at least one embodiment, at least one component shown or described with respect to FIGS. 22A and 22B is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics processor 2210 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics processor 2210 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIGS. 23A-23B illustrate additional exemplary graphics processor logic according to embodiments described herein. FIG. 23A illustrates a graphics core 2300 that may be included within graphics processor 2110 of FIG. 21 , in at least one embodiment, and may be a unified shader core 2255A-2255N as in FIG. 22B in at least one embodiment. FIG. 23B illustrates a highly-parallel general-purpose graphics processing unit 2330 suitable for deployment on a multi-chip module in at least one embodiment.

In at least one embodiment, graphics core 2300 includes a shared instruction cache 2302, a texture unit 2318, and a cache/shared memory 2320 that are common to execution resources within graphics core 2300. In at least one embodiment, graphics core 2300 can include multiple slices 2301A-2301N or partition for each core, and a graphics processor can include multiple instances of graphics core 2300. Slices 2301A-2301N can include support logic including a local instruction cache 2304A-2304N, a thread scheduler 2306A-2306N, a thread dispatcher 2308A-2308N, and a set of registers 2310A-2310N. In at least one embodiment, slices 2301A-2301N can include a set of additional function units (AFUs 2312A-2312N), floating-point units (FPU 2314A-2314N), integer arithmetic logic units (ALUs 2316-2316N), address computational units (ACU 2313A-2313N), double-precision floating-point units (DPFPU 2315A-2315N), and matrix processing units (MPU 2317A-2317N).

In at least one embodiment, FPUs 2314A-2314N can perform single-precision (32-bit) and half-precision (16-bit) floating point operations, while DPFPUs 2315A-2315N perform double precision (64-bit) floating point operations. In at least one embodiment, ALUs 2316A-2316N can perform variable precision integer operations at 8-bit, 16-bit, and 32-bit precision, and can be configured for mixed precision operations. In at least one embodiment, MPUs 2317A-2317N can also be configured for mixed precision matrix operations, including half-precision floating point and 8-bit integer operations. In at least one embodiment, MPUs 2317-2317N can perform a variety of matrix operations to accelerate machine learning application frameworks, including enabling support for accelerated general matrix to matrix multiplication (GEMM). In at least one embodiment, AFUs 2312A-2312N can perform additional logic operations not supported by floating-point or integer units, including trigonometric operations (e.g., Sine, Cosine, etc.).

In at least one embodiment, at least one component shown or described with respect to FIG. 23A is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics processor 2300 and is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics processor 2300 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 23B illustrates a general-purpose graphics processing unit (GPGPU) 2330 that can be configured to enable highly-parallel compute operations to be performed by an array of graphics processing units, in at least one embodiment. In at least one embodiment, GPGPU 2330 can be linked directly to other instances of GPGPU 2330 to create a multi-GPU cluster to improve training speed for deep neural networks. In at least one embodiment, GPGPU 2330 includes a host interface 2332 to enable a connection with a host processor. In at least one embodiment, host interface 2332 is a PCI Express interface. In at least one embodiment, host interface 2332 can be a vendor specific communications interface or communications fabric. In at least one embodiment, GPGPU 2330 receives commands from a host processor and uses a global scheduler 2334 to distribute execution threads associated with those commands to a set of compute clusters 2336A-2336H. In at least one embodiment, compute clusters 2336A-2336H share a cache memory 2338. In at least one embodiment, cache memory 2338 can serve as a higher-level cache for cache memories within compute clusters 2336A-2336H.

In at least one embodiment, GPGPU 2330 includes memory 2344A-2344B coupled with compute clusters 2336A-2336H via a set of memory controllers 2342A-2342B. In at least one embodiment, memory 2344A-2344B can include various types of memory devices including dynamic random access memory (DRAM) or graphics random access memory, such as synchronous graphics random access memory (SGRAM), including graphics double data rate (GDDR) memory.

In at least one embodiment, compute clusters 2336A-2336H each include a set of graphics cores, such as graphics core 2300 of FIG. 23A, which can include multiple types of integer and floating point logic units that can perform computational operations at a range of precisions including suited for machine learning computations. For example, in at least one embodiment, at least a subset of floating point units in each of compute clusters 2336A-2336H can be configured to perform 16-bit or 32-bit floating point operations, while a different subset of floating point units can be configured to perform 64-bit floating point operations.

In at least one embodiment, multiple instances of GPGPU 2330 can be configured to operate as a compute cluster. In at least one embodiment, communication used by compute clusters 2336A-2336H for synchronization and data exchange varies across embodiments. In at least one embodiment, multiple instances of GPGPU 2330 communicate over host interface 2332. In at least one embodiment, GPGPU 2330 includes an I/O hub 2339 that couples GPGPU 2330 with a GPU link 2340 that enables a direct connection to other instances of GPGPU 2330. In at least one embodiment, GPU link 2340 is coupled to a dedicated GPU-to-GPU bridge that enables communication and synchronization between multiple instances of GPGPU 2330. In at least one embodiment GPU link 2340 couples with a high speed interconnect to transmit and receive data to other GPGPUs or parallel processors. In at least one embodiment, multiple instances of GPGPU 2330 are located in separate data processing systems and communicate via a network device that is accessible via host interface 2332. In at least one embodiment GPU link 2340 can be configured to enable a connection to a host processor in addition to or as an alternative to host interface 2332.

In at least one embodiment, GPGPU 2330 can be configured to train neural networks. In at least one embodiment, GPGPU 2330 can be used within a inferencing platform. In at least one embodiment, in which GPGPU 2330 is used for inferencing, GPGPU may include fewer compute clusters 2336A-2336H relative to when GPGPU is used for training a neural network. In at least one embodiment, memory technology associated with memory 2344A-2344B may differ between inferencing and training configurations, with higher bandwidth memory technologies devoted to training configurations. In at least one embodiment, inferencing configuration of GPGPU 2330 can support inferencing specific instructions. For example, in at least one embodiment, an inferencing configuration can provide support for one or more 8-bit integer dot product instructions, which may be used during inferencing operations for deployed neural networks.

In at least one embodiment, at least one component shown or described with respect to FIG. 23B is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one GPGPU 2330 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one GPGPU 2330 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 24 is a block diagram illustrating a computing system 2400 according to at least one embodiment. In at least one embodiment, computing system 2400 includes a processing subsystem 2401 having one or more processor(s) 2402 and a system memory 2404 communicating via an interconnection path that may include a memory hub 2405. In at least one embodiment, memory hub 2405 may be a separate component within a chipset component or may be integrated within one or more processor(s) 2402. In at least one embodiment, memory hub 2405 couples with an I/O subsystem 2411 via a communication link 2406. In at least one embodiment, I/O subsystem 2411 includes an I/O hub 2407 that can enable computing system 2400 to receive input from one or more input device(s) 2408. In at least one embodiment, I/O hub 2407 can enable a display controller, which may be included in one or more processor(s) 2402, to provide outputs to one or more display device(s) 2410A. In at least one embodiment, one or more display device(s) 2410A coupled with I/O hub 2407 can include a local, internal, or embedded display device.

In at least one embodiment, processing subsystem 2401 includes one or more parallel processor(s) 2412 coupled to memory hub 2405 via a bus or other communication link 2413. In at least one embodiment, communication link 2413 may be one of any number of standards based communication link technologies or protocols, such as, but not limited to PCI Express, or may be a vendor specific communications interface or communications fabric. In at least one embodiment, one or more parallel processor(s) 2412 form a computationally focused parallel or vector processing system that can include a large number of processing cores and/or processing clusters, such as a many integrated core (MIC) processor. In at least one embodiment, one or more parallel processor(s) 2412 form a graphics processing subsystem that can output pixels to one of one or more display device(s) 2410A coupled via I/O Hub 2407. In at least one embodiment, one or more parallel processor(s) 2412 can also include a display controller and display interface (not shown) to enable a direct connection to one or more display device(s) 2410B.

In at least one embodiment, a system storage unit 2414 can connect to I/O hub 2407 to provide a storage mechanism for computing system 2400. In at least one embodiment, an I/O switch 2416 can be used to provide an interface mechanism to enable connections between I/O hub 2407 and other components, such as a network adapter 2418 and/or wireless network adapter 2419 that may be integrated into platform, and various other devices that can be added via one or more add-in device(s) 2420. In at least one embodiment, network adapter 2418 can be an Ethernet adapter or another wired network adapter. In at least one embodiment, wireless network adapter 2419 can include one or more of a Wi-Fi, Bluetooth, near field communication (NFC), or other network device that includes one or more wireless radios.

In at least one embodiment, computing system 2400 can include other components not explicitly shown, including USB or other port connections, optical storage drives, video capture devices, and like, may also be connected to I/O hub 2407. In at least one embodiment, communication paths interconnecting various components in FIG. 24 may be implemented using any suitable protocols, such as PCI (Peripheral Component Interconnect) based protocols (e.g., PCI-Express), or other bus or point-to-point communication interfaces and/or protocol(s), such as NV-Link high-speed interconnect, or interconnect protocols.

In at least one embodiment, one or more parallel processor(s) 2412 incorporate circuitry optimized for graphics and video processing, including, for example, video output circuitry, and constitutes a graphics processing unit (GPU). In at least one embodiment, one or more parallel processor(s) 2412 incorporate circuitry optimized for general purpose processing. In at least embodiment, components of computing system 2400 may be integrated with one or more other system elements on a single integrated circuit. For example, in at least one embodiment, one or more parallel processor(s) 2412, memory hub 2405, processor(s) 2402, and I/O hub 2407 can be integrated into a system on chip (SoC) integrated circuit. In at least one embodiment, components of computing system 2400 can be integrated into a single package to form a system in package (SIP) configuration. In at least one embodiment, at least a portion of components of computing system 2400 can be integrated into a multi-chip module (MCM), which can be interconnected with other multi-chip modules into a modular computing system.

In at least one embodiment, at least one component shown or described with respect to FIG. 24 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one of processor 2402 and parallel processor 2412 are used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one of processor 2402 and parallel processor 2412 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300. In at least one embodiment, processor 2402 executes a kernel launch function that passes parameters to at least one kernel on parallel processor 2412 that performs rate matching described in connection with FIGS. 1-13 .

Processors

FIG. 25A illustrates a parallel processor 2500 according to at least on embodiment. In at least one embodiment, various components of parallel processor 2500 may be implemented using one or more integrated circuit devices, such as programmable processors, application specific integrated circuits (ASICs), or field programmable gate arrays (FPGA). In at least one embodiment, illustrated parallel processor 2500 is a variant of one or more parallel processor(s) 2412 shown in FIG. 24 according to an exemplary embodiment.

In at least one embodiment, parallel processor 2500 includes a parallel processing unit 2502. In at least one embodiment, parallel processing unit 2502 includes an I/O unit 2504 that enables communication with other devices, including other instances of parallel processing unit 2502. In at least one embodiment, I/O unit 2504 may be directly connected to other devices. In at least one embodiment, I/O unit 2504 connects with other devices via use of a hub or switch interface, such as memory hub 2405. In at least one embodiment, connections between memory hub 2405 and I/O unit 2504 form a communication link 2413. In at least one embodiment, I/O unit 2504 connects with a host interface 2506 and a memory crossbar 2516, where host interface 2506 receives commands directed to performing processing operations and memory crossbar 2516 receives commands directed to performing memory operations.

In at least one embodiment, when host interface 2506 receives a command buffer via I/O unit 2504, host interface 2506 can direct work operations to perform those commands to a front end 2508. In at least one embodiment, front end 2508 couples with a scheduler 2510, which is configured to distribute commands or other work items to a processing cluster array 2512. In at least one embodiment, scheduler 2510 ensures that processing cluster array 2512 is properly configured and in a valid state before tasks are distributed to processing cluster array 2512 of processing cluster array 2512. In at least one embodiment, scheduler 2510 is implemented via firmware logic executing on a microcontroller. In at least one embodiment, microcontroller implemented scheduler 2510 is configurable to perform complex scheduling and work distribution operations at coarse and fine granularity, enabling rapid preemption and context switching of threads executing on processing array 2512. In at least one embodiment, host software can prove workloads for scheduling on processing array 2512 via one of multiple graphics processing doorbells. In at least one embodiment, workloads can then be automatically distributed across processing array 2512 by scheduler 2510 logic within a microcontroller including scheduler 2510.

In at least one embodiment, processing cluster array 2512 can include up to “N” processing clusters (e.g., cluster 2514A, cluster 2514B, through cluster 2514N). In at least one embodiment, each cluster 2514A-2514N of processing cluster array 2512 can execute a large number of concurrent threads. In at least one embodiment, scheduler 2510 can allocate work to clusters 2514A-2514N of processing cluster array 2512 using various scheduling and/or work distribution algorithms, which may vary depending on workload arising for each type of program or computation. In at least one embodiment, scheduling can be handled dynamically by scheduler 2510, or can be assisted in part by compiler logic during compilation of program logic configured for execution by processing cluster array 2512. In at least one embodiment, different clusters 2514A-2514N of processing cluster array 2512 can be allocated for processing different types of programs or for performing different types of computations.

In at least one embodiment, processing cluster array 2512 can be configured to perform various types of parallel processing operations. In at least one embodiment, processing cluster array 2512 is configured to perform general-purpose parallel compute operations. For example, in at least one embodiment, processing cluster array 2512 can include logic to execute processing tasks including filtering of video and/or audio data, performing modeling operations, including physics operations, and performing data transformations.

In at least one embodiment, processing cluster array 2512 is configured to perform parallel graphics processing operations. In at least one embodiment, processing cluster array 2512 can include additional logic to support execution of such graphics processing operations, including, but not limited to texture sampling logic to perform texture operations, as well as tessellation logic and other vertex processing logic. In at least one embodiment, processing cluster array 2512 can be configured to execute graphics processing related shader programs such as, but not limited to vertex shaders, tessellation shaders, geometry shaders, and pixel shaders. In at least one embodiment, parallel processing unit 2502 can transfer data from system memory via I/O unit 2504 for processing. In at least one embodiment, during processing, transferred data can be stored to on-chip memory (e.g., parallel processor memory 2522) during processing, then written back to system memory.

In at least one embodiment, when parallel processing unit 2502 is used to perform graphics processing, scheduler 2510 can be configured to divide a processing workload into approximately equal sized tasks, to better enable distribution of graphics processing operations to multiple clusters 2514A-2514N of processing cluster array 2512. In at least one embodiment, portions of processing cluster array 2512 can be configured to perform different types of processing. For example, in at least one embodiment, a first portion may be configured to perform vertex shading and topology generation, a second portion may be configured to perform tessellation and geometry shading, and a third portion may be configured to perform pixel shading or other screen space operations, to produce a rendered image for display. In at least one embodiment, intermediate data produced by one or more of clusters 2514A-2514N may be stored in buffers to allow intermediate data to be transmitted between clusters 2514A-2514N for further processing.

In at least one embodiment, processing cluster array 2512 can receive processing tasks to be executed via scheduler 2510, which receives commands defining processing tasks from front end 2508. In at least one embodiment, processing tasks can include indices of data to be processed, e.g., surface (patch) data, primitive data, vertex data, and/or pixel data, as well as state parameters and commands defining how data is to be processed (e.g., what program is to be executed). In at least one embodiment, scheduler 2510 may be configured to fetch indices corresponding to tasks or may receive indices from front end 2508. In at least one embodiment, front end 2508 can be configured to ensure processing cluster array 2512 is configured to a valid state before a workload specified by incoming command buffers (e.g., batch-buffers, push buffers, etc.) is initiated.

In at least one embodiment, each of one or more instances of parallel processing unit 2502 can couple with parallel processor memory 2522. In at least one embodiment, parallel processor memory 2522 can be accessed via memory crossbar 2516, which can receive memory requests from processing cluster array 2512 as well as I/O unit 2504. In at least one embodiment, memory crossbar 2516 can access parallel processor memory 2522 via a memory interface 2518. In at least one embodiment, memory interface 2518 can include multiple partition units (e.g., partition unit 2520A, partition unit 2520B, through partition unit 2520N) that can each couple to a portion (e.g., memory unit) of parallel processor memory 2522. In at least one embodiment, a number of partition units 2520A-2520N is configured to be equal to a number of memory units, such that a first partition unit 2520A has a corresponding first memory unit 2524A, a second partition unit 2520B has a corresponding memory unit 2524B, and an Nth partition unit 2520N has a corresponding Nth memory unit 2524N. In at least one embodiment, a number of partition units 2520A-2520N may not be equal to a number of memory devices.

In at least one embodiment, memory units 2524A-2524N can include various types of memory devices, including dynamic random access memory (DRAM) or graphics random access memory, such as synchronous graphics random access memory (SGRAM), including graphics double data rate (GDDR) memory. In at least one embodiment, memory units 2524A-2524N may also include 3D stacked memory, including but not limited to high bandwidth memory (HBM). In at least one embodiment, render targets, such as frame buffers or texture maps may be stored across memory units 2524A-2524N, allowing partition units 2520A-2520N to write portions of each render target in parallel to efficiently use available bandwidth of parallel processor memory 2522. In at least one embodiment, a local instance of parallel processor memory 2522 may be excluded in favor of a unified memory design that utilizes system memory in conjunction with local cache memory.

In at least one embodiment, any one of clusters 2514A-2514N of processing cluster array 2512 can process data that will be written to any of memory units 2524A-2524N within parallel processor memory 2522. In at least one embodiment, memory crossbar 2516 can be configured to transfer an output of each cluster 2514A-2514N to any partition unit 2520A-2520N or to another cluster 2514A-2514N, which can perform additional processing operations on an output. In at least one embodiment, each cluster 2514A-2514N can communicate with memory interface 2518 through memory crossbar 2516 to read from or write to various external memory devices. In at least one embodiment, memory crossbar 2516 has a connection to memory interface 2518 to communicate with I/O unit 2504, as well as a connection to a local instance of parallel processor memory 2522, enabling processing units within different processing clusters 2514A-2514N to communicate with system memory or other memory that is not local to parallel processing unit 2502. In at least one embodiment, memory crossbar 2516 can use virtual channels to separate traffic streams between clusters 2514A-2514N and partition units 2520A-2520N.

In at least one embodiment, multiple instances of parallel processing unit 2502 can be provided on a single add-in card, or multiple add-in cards can be interconnected. In at least one embodiment, different instances of parallel processing unit 2502 can be configured to inter-operate even if different instances have different numbers of processing cores, different amounts of local parallel processor memory, and/or other configuration differences. For example, in at least one embodiment, some instances of parallel processing unit 2502 can include higher precision floating point units relative to other instances. In at least one embodiment, systems incorporating one or more instances of parallel processing unit 2502 or parallel processor 2500 can be implemented in a variety of configurations and form factors, including but not limited to desktop, laptop, or handheld personal computers, servers, workstations, game consoles, and/or embedded systems.

FIG. 25B is a block diagram of a partition unit 2520 according to at least one embodiment. In at least one embodiment, partition unit 2520 is an instance of one of partition units 2520A-2520N of FIG. 25A. In at least one embodiment, partition unit 2520 includes an L2 cache 2521, a frame buffer interface 2525, and a ROP 2526 (raster operations unit). L2 cache 2521 is a read/write cache that is configured to perform load and store operations received from memory crossbar 2516 and ROP 2526. In at least one embodiment, read misses and urgent write-back requests are output by L2 cache 2521 to frame buffer interface 2525 for processing. In at least one embodiment, updates can also be sent to a frame buffer via frame buffer interface 2525 for processing. In at least one embodiment, frame buffer interface 2525 interfaces with one of memory units in parallel processor memory, such as memory units 2524A-2524N of FIG. 25 (e.g., within parallel processor memory 2522).

In at least one embodiment, ROP 2526 is a processing unit that performs raster operations such as stencil, z test, blending, and like. In at least one embodiment, ROP 2526 then outputs processed graphics data that is stored in graphics memory. In at least one embodiment, ROP 2526 includes compression logic to compress depth or color data that is written to memory and decompress depth or color data that is read from memory. In at least one embodiment, compression logic can be lossless compression logic that makes use of one or more of multiple compression algorithms. In at least one embodiment, type of compression that is performed by ROP 2526 can vary based on statistical characteristics of data to be compressed. For example, in at least one embodiment, delta color compression is performed on depth and color data on a per-tile basis.

In In at least one embodiment, ROP 2526 is included within each processing cluster (e.g., cluster 2514A-2514N of FIG. 25 ) instead of within partition unit 2520. In at least one embodiment, read and write requests for pixel data are transmitted over memory crossbar 2516 instead of pixel fragment data. In at least one embodiment, processed graphics data may be displayed on a display device, such as one of one or more display device(s) 2410 of FIG. 24 , routed for further processing by processor(s) 2402, or routed for further processing by one of processing entities within parallel processor 2500 of FIG. 25A.

FIG. 25C is a block diagram of a processing cluster 2514 within a parallel processing unit according to at least one embodiment. In at least one embodiment, a processing cluster is an instance of one of processing clusters 2514A-2514N of FIG. 25 . In at least one embodiment, processing cluster 2514 can be configured to execute many threads in parallel, where term “thread” refers to an instance of a particular program executing on a particular set of input data. In at least one embodiment, single-instruction, multiple-data (SIMD) instruction issue techniques are used to support parallel execution of a large number of threads without providing multiple independent instruction units. In at least one embodiment, single-instruction, multiple-thread (SIMT) techniques are used to support parallel execution of a large number of generally synchronized threads, using a common instruction unit configured to issue instructions to a set of processing engines within each one of processing clusters.

In at least one embodiment, operation of processing cluster 2514 can be controlled via a pipeline manager 2532 that distributes processing tasks to SIMT parallel processors. In at least one embodiment, pipeline manager 2532 receives instructions from scheduler 2510 of FIG. 25 and manages execution of those instructions via a graphics multiprocessor 2534 and/or a texture unit 2536. In at least one embodiment, graphics multiprocessor 2534 is an exemplary instance of a SIMT parallel processor. However, in at least one embodiment, various types of SIMT parallel processors of differing architectures may be included within processing cluster 2514. In at least one embodiment, one or more instances of graphics multiprocessor 2534 can be included within a processing cluster 2514. In at least one embodiment, graphics multiprocessor 2534 can process data and a data crossbar 2540 can be used to distribute processed data to one of multiple possible destinations, including other shader units. In at least one embodiment, pipeline manager 2532 can facilitate distribution of processed data by specifying destinations for processed data to be distributed via data crossbar 2540.

In at least one embodiment, each graphics multiprocessor 2534 within processing cluster 2514 can include an identical set of functional execution logic (e.g., arithmetic logic units, load-store units, etc.). In at least one embodiment, functional execution logic can be configured in a pipelined manner in which new instructions can be issued before previous instructions are complete. In at least one embodiment, functional execution logic supports a variety of operations including integer and floating point arithmetic, comparison operations, Boolean operations, bit-shifting, and computation of various algebraic functions. In at least one embodiment, same functional-unit hardware can be leveraged to perform different operations and any combination of functional units may be present.

In at least one embodiment, instructions transmitted to processing cluster 2514 constitute a thread. In at least one embodiment, a set of threads executing across a set of parallel processing engines is a thread group. In at least one embodiment, thread group executes a program on different input data. In at least one embodiment, each thread within a thread group can be assigned to a different processing engine within a graphics multiprocessor 2534. In at least one embodiment, a thread group may include fewer threads than a number of processing engines within graphics multiprocessor 2534. In at least one embodiment, when a thread group includes fewer threads than a number of processing engines, one or more of processing engines may be idle during cycles in which that thread group is being processed. In at least one embodiment, a thread group may also include more threads than a number of processing engines within graphics multiprocessor 2534. In at least one embodiment, when a thread group includes more threads than number of processing engines within graphics multiprocessor 2534, processing can be performed over consecutive clock cycles. In at least one embodiment, multiple thread groups can be executed concurrently on a graphics multiprocessor 2534.

In at least one embodiment, graphics multiprocessor 2534 includes an internal cache memory to perform load and store operations. In at least one embodiment, graphics multiprocessor 2534 can forego an internal cache and use a cache memory (e.g., L1 cache 2548) within processing cluster 2514. In at least one embodiment, each graphics multiprocessor 2534 also has access to L2 caches within partition units (e.g., partition units 2520A-2520N of FIG. 25 ) that are shared among all processing clusters 2514 and may be used to transfer data between threads. In at least one embodiment, graphics multiprocessor 2534 may also access off-chip global memory, which can include one or more of local parallel processor memory and/or system memory. In at least one embodiment, any memory external to parallel processing unit 2502 may be used as global memory. In at least one embodiment, processing cluster 2514 includes multiple instances of graphics multiprocessor 2534 can share common instructions and data, which may be stored in L1 cache 2548.

In at least one embodiment, each processing cluster 2514 may include an MMU 2545 (memory management unit) that is configured to map virtual addresses into physical addresses. In at least one embodiment, one or more instances of MMU 2545 may reside within memory interface 2518 of FIG. 25 . In at least one embodiment, MMU 2545 includes a set of page table entries (PTEs) used to map a virtual address to a physical address of a tile (talk more about tiling) and optionally a cache line index. In at least one embodiment, MMU 2545 may include address translation lookaside buffers (TLB) or caches that may reside within graphics multiprocessor 2534 or L1 cache or processing cluster 2514. In at least one embodiment, physical address is processed to distribute surface data access locality to allow efficient request interleaving among partition units. In at least one embodiment, cache line index may be used to determine whether a request for a cache line is a hit or miss.

In at least one embodiment, a processing cluster 2514 may be configured such that each graphics multiprocessor 2534 is coupled to a texture unit 2536 for performing texture mapping operations, e.g., determining texture sample positions, reading texture data, and filtering texture data. In at least one embodiment, texture data is read from an internal texture L1 cache (not shown) or from an L1 cache within graphics multiprocessor 2534 and is fetched from an L2 cache, local parallel processor memory, or system memory, as needed. In at least one embodiment, each graphics multiprocessor 2534 outputs processed tasks to data crossbar 2540 to provide processed task to another processing cluster 2514 for further processing or to store processed task in an L2 cache, local parallel processor memory, or system memory via memory crossbar 2516. In at least one embodiment, preROP 2542 (pre-raster operations unit) is configured to receive data from graphics multiprocessor 2534, direct data to ROP units, which may be located with partition units as described herein (e.g., partition units 2520A-2520N of FIG. 25 ). In at least one embodiment, PreROP 2542 unit can perform optimizations for color blending, organize pixel color data, and perform address translations.

In at least one embodiment, at least one component shown or described with respect to FIGS. 25A-C is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one parallel processor 2500 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one parallel processor 2500 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 25D shows a graphics multiprocessor 2534 according to at least one embodiment. In at least one embodiment, graphics multiprocessor 2534 couples with pipeline manager 2532 of processing cluster 2514. In at least one embodiment, graphics multiprocessor 2534 has an execution pipeline including but not limited to an instruction cache 2552, an instruction unit 2554, an address mapping unit 2556, a register file 2558, one or more general purpose graphics processing unit (GPGPU) cores 2562, and one or more load/store units 2566. GPGPU cores 2562 and load/store units 2566 are coupled with cache memory 2572 and shared memory 2570 via a memory and cache interconnect 2568.

In at least one embodiment, instruction cache 2552 receives a stream of instructions to execute from pipeline manager 2532. In at least one embodiment, instructions are cached in instruction cache 2552 and dispatched for execution by instruction unit 2554. In at least one embodiment, instruction unit 2554 can dispatch instructions as thread groups (e.g., warps), with each thread of thread group assigned to a different execution unit within GPGPU core 2562. In at least one embodiment, an instruction can access any of a local, shared, or global address space by specifying an address within a unified address space. In at least one embodiment, address mapping unit 2556 can be used to translate addresses in a unified address space into a distinct memory address that can be accessed by load/store units 2566.

In at least one embodiment, register file 2558 provides a set of registers for functional units of graphics multiprocessor 2534. In at least one embodiment, register file 2558 provides temporary storage for operands connected to data paths of functional units (e.g., GPGPU cores 2562, load/store units 2566) of graphics multiprocessor 2534. In at least one embodiment, register file 2558 is divided between each of functional units such that each functional unit is allocated a dedicated portion of register file 2558. In at least one embodiment, register file 2558 is divided between different warps being executed by graphics multiprocessor 2534.

In at least one embodiment, GPGPU cores 2562 can each include floating point units (FPUs) and/or integer arithmetic logic units (ALUs) that are used to execute instructions of graphics multiprocessor 2534. GPGPU cores 2562 can be similar in architecture or can differ in architecture. In at least one embodiment, a first portion of GPGPU cores 2562 include a single precision FPU and an integer ALU while a second portion of GPGPU cores include a double precision FPU. In at least one embodiment, FPUs can implement IEEE 754-2008 standard for floating point arithmetic or enable variable precision floating point arithmetic. In at least one embodiment, graphics multiprocessor 2534 can additionally include one or more fixed function or special function units to perform specific functions such as copy rectangle or pixel blending operations. In at least one embodiment one or more of GPGPU cores can also include fixed or special function logic.

In at least one embodiment, GPGPU cores 2562 include SIMD logic capable of performing a single instruction on multiple sets of data. In at least one embodiment GPGPU cores 2562 can physically execute SIMD4, SIMD8, and SIMD16 instructions and logically execute SIMD1, SIMD2, and SIMND32 instructions. In at least one embodiment, SIMD instructions for GPGPU cores can be generated at compile time by a shader compiler or automatically generated when executing programs written and compiled for single program multiple data (SPMD) or SIMT architectures. In at least one embodiment, multiple threads of a program configured for an SIMT execution model can executed via a single SIMD instruction. For example, in at least one embodiment, eight SIMT threads that perform same or similar operations can be executed in parallel via a single SIMD8 logic unit.

In at least one embodiment, memory and cache interconnect 2568 is an interconnect network that connects each functional unit of graphics multiprocessor 2534 to register file 2558 and to shared memory 2570. In at least one embodiment, memory and cache interconnect 2568 is a crossbar interconnect that allows load/store unit 2566 to implement load and store operations between shared memory 2570 and register file 2558. In at least one embodiment, register file 2558 can operate at a same frequency as GPGPU cores 2562, thus data transfer between GPGPU cores 2562 and register file 2558 is very low latency. In at least one embodiment, shared memory 2570 can be used to enable communication between threads that execute on functional units within graphics multiprocessor 2534. In at least one embodiment, cache memory 2572 can be used as a data cache for example, to cache texture data communicated between functional units and texture unit 2536. In at least one embodiment, shared memory 2570 can also be used as a program managed cached. In at least one embodiment, threads executing on GPGPU cores 2562 can programmatically store data within shared memory in addition to automatically cached data that is stored within cache memory 2572.

In at least one embodiment, a parallel processor or GPGPU as described herein is communicatively coupled to host/processor cores to accelerate graphics operations, machine-learning operations, pattern analysis operations, and various general purpose GPU (GPGPU) functions. In at least one embodiment, GPU may be communicatively coupled to host processor/cores over a bus or other interconnect (e.g., a high speed interconnect such as PCIe or NVLink). In at least one embodiment, GPU may be integrated on same package or chip as cores and communicatively coupled to cores over an internal processor bus/interconnect (i.e., internal to package or chip). In at least one embodiment, regardless of manner in which GPU is connected, processor cores may allocate work to GPU in form of sequences of commands/instructions contained in a work descriptor. In at least one embodiment, GPU then uses dedicated circuitry/logic for efficiently processing these commands/instructions.

In at least one embodiment, at least one component shown or described with respect to FIG. 25D is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics multiprocessor 2534 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics multiprocessor 2534 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 26 illustrates a multi-GPU computing system 2600, according to at least one embodiment. In at least one embodiment, multi-GPU computing system 2600 can include a processor 2602 coupled to multiple general purpose graphics processing units (GPGPUs) 2606A-D via a host interface switch 2604. In at least one embodiment, host interface switch 2604 is a PCI express switch device that couples processor 2602 to a PCI express bus over which processor 2602 can communicate with GPGPUs 2606A-D. GPGPUs 2606A-D can interconnect via a set of high-speed point to point GPU to GPU links 2616. In at least one embodiment, GPU to GPU links 2616 connect to each of GPGPUs 2606A-D via a dedicated GPU link. In at least one embodiment, P2P GPU links 2616 enable direct communication between each of GPGPUs 2606A-D without requiring communication over host interface bus 2604 to which processor 2602 is connected. In at least one embodiment, with GPU-to-GPU traffic directed to P2P GPU links 2616, host interface bus 2604 remains available for system memory access or to communicate with other instances of multi-GPU computing system 2600, for example, via one or more network devices. While in at least one embodiment GPGPUs 2606A-D connect to processor 2602 via host interface switch 2604, in at least one embodiment processor 2602 includes direct support for P2P GPU links 2616 and can connect directly to GPGPUs 2606A-D.

In at least one embodiment, at least one component shown or described with respect to FIG. 26 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one GPGPU 2606 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one GPGPU 2606 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300. In at least one embodiment, processor 2602 executes a kernel launch function that passes parameters to at least one kernel on at least one GPGPU 2606 that performs rate matching described in connection with FIGS. 1-13 .

FIG. 27 is a block diagram of a graphics processor 2700, according to at least one embodiment. In at least one embodiment, graphics processor 2700 includes a ring interconnect 2702, a pipeline front-end 2704, a media engine 2737, and graphics cores 2780A-2780N. In at least one embodiment, ring interconnect 2702 couples graphics processor 2700 to other processing units, including other graphics processors or one or more general-purpose processor cores. In at least one embodiment, graphics processor 2700 is one of many processors integrated within a multi-core processing system.

In at least one embodiment, graphics processor 2700 receives batches of commands via ring interconnect 2702. In at least one embodiment, incoming commands are interpreted by a command streamer 2703 in pipeline front-end 2704. In at least one embodiment, graphics processor 2700 includes scalable execution logic to perform 3D geometry processing and media processing via graphics core(s) 2780A-2780N. In at least one embodiment, for 3D geometry processing commands, command streamer 2703 supplies commands to geometry pipeline 2736. In at least one embodiment, for at least some media processing commands, command streamer 2703 supplies commands to a video front end 2734, which couples with a media engine 2737. In at least one embodiment, media engine 2737 includes a Video Quality Engine (VQE) 2730 for video and image post-processing and a multi-format encode/decode (MFX) 2733 engine to provide hardware-accelerated media data encode and decode. In at least one embodiment, geometry pipeline 2736 and media engine 2737 each generate execution threads for thread execution resources provided by at least one graphics core 2780A.

In at least one embodiment, graphics processor 2700 includes scalable thread execution resources featuring modular cores 2780A-2780N (sometimes referred to as core slices), each having multiple sub-cores 2750A-550N, 2760A-2760N (sometimes referred to as core sub-slices). In at least one embodiment, graphics processor 2700 can have any number of graphics cores 2780A through 2780N. In at least one embodiment, graphics processor 2700 includes a graphics core 2780A having at least a first sub-core 2750A and a second sub-core 2760A. In at least one embodiment, graphics processor 2700 is a low power processor with a single sub-core (e.g., 2750A). In at least one embodiment, graphics processor 2700 includes multiple graphics cores 2780A-2780N, each including a set of first sub-cores 2750A-2750N and a set of second sub-cores 2760A-2760N. In at least one embodiment, each sub-core in first sub-cores 2750A-2750N includes at least a first set of execution units 2752A-2752N and media/texture samplers 2754A-2754N. In at least one embodiment, each sub-core in second sub-cores 2760A-2760N includes at least a second set of execution units 2762A-2762N and samplers 2764A-2764N. In at least one embodiment, each sub-core 2750A-2750N, 2760A-2760N shares a set of shared resources 2770A-2770N. In at least one embodiment, shared resources include shared cache memory and pixel operation logic.

In at least one embodiment, at least one component shown or described with respect to FIG. 27 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics processor 2700 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics processor 2700 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 28 is a block diagram illustrating micro-architecture for a processor 2800 that may include logic circuits to perform instructions, according to at least one embodiment. In at least one embodiment, processor 2800 may perform instructions, including x86 instructions, ARM instructions, specialized instructions for application-specific integrated circuits (ASICs), etc. In at least one embodiment, processor 2810 may include registers to store packed data, such as 64-bit wide MMX™ registers in microprocessors enabled with MMX technology from Intel Corporation of Santa Clara, Calif. In at least one embodiment, MMX registers, available in both integer and floating point forms, may operate with packed data elements that accompany single instruction, multiple data (“SIMD”) and streaming SIMD extensions (“SSE”) instructions. In at least one embodiment, 128-bit wide XMM registers relating to SSE2, SSE3, SSE4, AVX, or beyond (referred to generically as “SSEx”) technology may hold such packed data operands. In at least one embodiment, processors 2810 may perform instructions to accelerate machine learning or deep learning algorithms, training, or inferencing.

In at least one embodiment, processor 2800 includes an in-order front end (“front end”) 2801 to fetch instructions to be executed and prepare instructions to be used later in processor pipeline. In at least one embodiment, front end 2801 may include several units. In at least one embodiment, an instruction prefetcher 2826 fetches instructions from memory and feeds instructions to an instruction decoder 2828 which in turn decodes or interprets instructions. For example, in at least one embodiment, instruction decoder 2828 decodes a received instruction into one or more operations called “micro-instructions” or “micro-operations” (also called “micro ops” or “uops”) that machine may execute. In at least one embodiment, instruction decoder 2828 parses instruction into an opcode and corresponding data and control fields that may be used by micro-architecture to perform operations in accordance with at least one embodiment. In at least one embodiment, a trace cache 2830 may assemble decoded uops into program ordered sequences or traces in a uop queue 2834 for execution. In at least one embodiment, when trace cache 2830 encounters a complex instruction, a microcode ROM 2832 provides uops needed to complete operation.

In at least one embodiment, some instructions may be converted into a single micro-op, whereas others need several micro-ops to complete full operation. In at least one embodiment, if more than four micro-ops are needed to complete an instruction, instruction decoder 2828 may access microcode ROM 2832 to perform instruction. In at least one embodiment, an instruction may be decoded into a small number of micro-ops for processing at instruction decoder 2828. In at least one embodiment, an instruction may be stored within microcode ROM 2832 should a number of micro-ops be needed to accomplish operation. In at least one embodiment, trace cache 2830 refers to an entry point programmable logic array (“PLA”) to determine a correct micro-instruction pointer for reading microcode sequences to complete one or more instructions from microcode ROM 2832 in accordance with at least one embodiment. In at least one embodiment, after microcode ROM 2832 finishes sequencing micro-ops for an instruction, front end 2801 of machine may resume fetching micro-ops from trace cache 2830.

In at least one embodiment, out-of-order execution engine (“out of order engine”) 2803 may prepare instructions for execution. In at least one embodiment, out-of-order execution logic has a number of buffers to smooth out and re-order flow of instructions to optimize performance as they go down pipeline and get scheduled for execution. out-of-order execution engine 2803 includes, without limitation, an allocator/register renamer 2840, a memory uop queue 2842, an integer/floating point uop queue 2844, a memory scheduler 2846, a fast scheduler 2802, a slow/general floating point scheduler (“slow/general FP scheduler”) 2804, and a simple floating point scheduler (“simple FP scheduler”) 2806. In at least one embodiment, fast schedule 2802, slow/general floating point scheduler 2804, and simple floating point scheduler 2806 are also collectively referred to herein as “uop schedulers 2802, 2804, 2806.” In at least one embodiment, allocator/register renamer 2840 allocates machine buffers and resources that each uop needs in order to execute. In at least one embodiment, allocator/register renamer 2840 renames logic registers onto entries in a register file. In at least one embodiment, allocator/register renamer 2840 also allocates an entry for each uop in one of two uop queues, memory uop queue 2842 for memory operations and integer/floating point uop queue 2844 for non-memory operations, in front of memory scheduler 2846 and uop schedulers 2802, 2804, 2806. In at least one embodiment, uop schedulers 2802, 2804, 2806, determine when a uop is ready to execute based on readiness of their dependent input register operand sources and availability of execution resources uops need to complete their operation. In at least one embodiment, fast scheduler 2802 of at least one embodiment may schedule on each half of main clock cycle while slow/general floating point scheduler 2804 and simple floating point scheduler 2806 may schedule once per main processor clock cycle. In at least one embodiment, uop schedulers 2802, 2804, 2806 arbitrate for dispatch ports to schedule uops for execution.

In at least one embodiment, execution block b11 includes, without limitation, an integer register file/bypass network 2808, a floating point register file/bypass network (“FP register file/bypass network”) 2810, address generation units (“AGUs”) 2812 and 2814, fast Arithmetic Logic Units (ALUs) (“fast ALUs”) 2816 and 2818, a slow Arithmetic Logic Unit (“slow ALU”) 2820, a floating point ALU (“FP”) 2822, and a floating point move unit (“FP move”) 2824. In at least one embodiment, integer register file/bypass network 2808 and floating point register file/bypass network 2810 are also referred to herein as “register files 2808, 2810.” In at least one embodiment, AGUSs 2812 and 2814, fast ALUs 2816 and 2818, slow ALU 2820, floating point ALU 2822, and floating point move unit 2824 are also referred to herein as “execution units 2812, 2814, 2816, 2818, 2820, 2822, and 2824.” In at least one embodiment, execution block b11 may include, without limitation, any number (including zero) and type of register files, bypass networks, address generation units, and execution units, in any combination.

In at least one embodiment, register files 2808, 2810 may be arranged between uop schedulers 2802, 2804, 2806, and execution units 2812, 2814, 2816, 2818, 2820, 2822, and 2824. In at least one embodiment, integer register file/bypass network 2808 performs integer operations. In at least one embodiment, floating point register file/bypass network 2810 performs floating point operations. In at least one embodiment, each of register files 2808, 2810 may include, without limitation, a bypass network that may bypass or forward just completed results that have not yet been written into register file to new dependent uops. In at least one embodiment, register files 2808, 2810 may communicate data with each other. In at least one embodiment, integer register file/bypass network 2808 may include, without limitation, two separate register files, one register file for low-order thirty-two bits of data and a second register file for high order thirty-two bits of data. In at least one embodiment, floating point register file/bypass network 2810 may include, without limitation, 128-bit wide entries because floating point instructions typically have operands from 64 to 128 bits in width.

In at least one embodiment, execution units 2812, 2814, 2816, 2818, 2820, 2822, 2824 may execute instructions. In at least one embodiment, register files 2808, 2810 store integer and floating point data operand values that micro-instructions need to execute. In at least one embodiment, processor 2800 may include, without limitation, any number and combination of execution units 2812, 2814, 2816, 2818, 2820, 2822, 2824. In at least one embodiment, floating point ALU 2822 and floating point move unit 2824, may execute floating point, MMX, SIMD, AVX and SSE, or other operations, including specialized machine learning instructions. In at least one embodiment, floating point ALU 2822 may include, without limitation, a 64-bit by 64-bit floating point divider to execute divide, square root, and remainder micro ops. In at least one embodiment, instructions involving a floating point value may be handled with floating point hardware. In at least one embodiment, ALU operations may be passed to fast ALUs 2816, 2818. In at least one embodiment, fast ALUS 2816, 2818 may execute fast operations with an effective latency of half a clock cycle. In at least one embodiment, most complex integer operations go to slow ALU 2820 as slow ALU 2820 may include, without limitation, integer execution hardware for long-latency type of operations, such as a multiplier, shifts, flag logic, and branch processing. In at least one embodiment, memory load/store operations may be executed by AGUS 2812, 2814. In at least one embodiment, fast ALU 2816, fast ALU 2818, and slow ALU 2820 may perform integer operations on 64-bit data operands. In at least one embodiment, fast ALU 2816, fast ALU 2818, and slow ALU 2820 may be implemented to support a variety of data bit sizes including sixteen, thirty-two, 128, 256, etc. In at least one embodiment, floating point ALU 2822 and floating point move unit 2824 may be implemented to support a range of operands having bits of various widths. In at least one embodiment, floating point ALU 2822 and floating point move unit 2824 may operate on 128-bit wide packed data operands in conjunction with SIMD and multimedia instructions.

In at least one embodiment, uop schedulers 2802, 2804, 2806, dispatch dependent operations before parent load has finished executing. In at least one embodiment, as uops may be speculatively scheduled and executed in processor 2800, processor 2800 may also include logic to handle memory misses. In at least one embodiment, if a data load misses in data cache, there may be dependent operations in flight in pipeline that have left scheduler with temporarily incorrect data. In at least one embodiment, a replay mechanism tracks and re-executes instructions that use incorrect data. In at least one embodiment, dependent operations might need to be replayed and independent ones may be allowed to complete. In at least one embodiment, schedulers and replay mechanism of at least one embodiment of a processor may also be designed to catch instruction sequences for text string comparison operations.

In at least one embodiment, term “registers” may refer to on-board processor storage locations that may be used as part of instructions to identify operands. In at least one embodiment, registers may be those that may be usable from outside of processor (from a programmer's perspective). In at least one embodiment, registers might not be limited to a particular type of circuit. Rather, in at least one embodiment, a register may store data, provide data, and perform functions described herein. In at least one embodiment, registers described herein may be implemented by circuitry within a processor using any number of different techniques, such as dedicated physical registers, dynamically allocated physical registers using register renaming, combinations of dedicated and dynamically allocated physical registers, etc. In at least one embodiment, integer registers store 32-bit integer data. A register file of at least one embodiment also contains eight multimedia SIMD registers for packed data.

In at least one embodiment, at least one component shown or described with respect to FIG. 28 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one processor 2800 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one processor 2800 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 29 is a block diagram of a processing system, according to at least one embodiment. In at least one embodiment, system 2900 includes one or more processors 2902 and one or more graphics processors 2908, and may be a single processor desktop system, a multiprocessor workstation system, or a server system having a large number of processors 2902 or processor cores 2907. In at least one embodiment, system 2900 is a processing platform incorporated within a system-on-a-chip (SoC) integrated circuit for use in mobile, handheld, or embedded devices.

In at least one embodiment, system 2900 can include, or be incorporated within a server-based gaming platform, a game console, including a game and media console, a mobile gaming console, a handheld game console, or an online game console. In at least one embodiment, system 2900 is a mobile phone, smart phone, tablet computing device or mobile Internet device. In at least one embodiment, processing system 2900 can also include, couple with, or be integrated within a wearable device, such as a smart watch wearable device, smart eyewear device, augmented reality device, or virtual reality device. In at least one embodiment, processing system 2900 is a television or set top box device having one or more processors 2902 and a graphical interface generated by one or more graphics processors 2908.

In at least one embodiment, one or more processors 2902 each include one or more processor cores 2907 to process instructions which, when executed, perform operations for system and user software. In at least one embodiment, each of one or more processor cores 2907 is configured to process a specific instruction set 2909. In at least one embodiment, instruction set 2909 may facilitate Complex Instruction Set Computing (CISC), Reduced Instruction Set Computing (RISC), or computing via a Very Long Instruction Word (VLIW). In at least one embodiment, processor cores 2907 may each process a different instruction set 2909, which may include instructions to facilitate emulation of other instruction sets. In at least one embodiment, processor core 2907 may also include other processing devices, such a Digital Signal Processor (DSP).

In at least one embodiment, processor 2902 includes cache memory 2904. In at least one embodiment, processor 2902 can have a single internal cache or multiple levels of internal cache. In at least one embodiment, cache memory is shared among various components of processor 2902. In at least one embodiment, processor 2902 also uses an external cache (e.g., a Level-3 (L3) cache or Last Level Cache (LLC)) (not shown), which may be shared among processor cores 2907 using known cache coherency techniques. In at least one embodiment, register file 2906 is additionally included in processor 2902 which may include different types of registers for storing different types of data (e.g., integer registers, floating point registers, status registers, and an instruction pointer register). In at least one embodiment, register file 2906 may include general-purpose registers or other registers.

In at least one embodiment, one or more processor(s) 2902 are coupled with one or more interface bus (es) 2910 to transmit communication signals such as address, data, or control signals between processor 2902 and other components in system 2900. In at least one embodiment interface bus 2910, in one embodiment, can be a processor bus, such as a version of a Direct Media Interface (DMI) bus. In at least one embodiment, interface 2910 is not limited to a DMI bus, and may include one or more Peripheral Component Interconnect buses (e.g., PCI, PCI Express), memory busses, or other types of interface busses. In at least one embodiment processor(s) 2902 include an integrated memory controller 2916 and a platform controller hub 2930. In at least one embodiment, memory controller 2916 facilitates communication between a memory device and other components of system 2900, while platform controller hub (PCH) 2930 provides connections to I/O devices via a local I/O bus.

In at least one embodiment, memory device 2920 can be a dynamic random access memory (DRAM) device, a static random access memory (SRAM) device, flash memory device, phase-change memory device, or some other memory device having suitable performance to serve as process memory. In at least one embodiment memory device 2920 can operate as system memory for system 2900, to store data 2922 and instructions 2921 for use when one or more processors 2902 executes an application or process. In at least one embodiment, memory controller 2916 also couples with an optional external graphics processor 2912, which may communicate with one or more graphics processors 2908 in processors 2902 to perform graphics and media operations. In at least one embodiment, a display device 2911 can connect to processor(s) 2902. In at least one embodiment display device 2911 can include one or more of an internal display device, as in a mobile electronic device or a laptop device or an external display device attached via a display interface (e.g., DisplayPort, etc.). In at least one embodiment, display device 2911 can include a head mounted display (HMD) such as a stereoscopic display device for use in virtual reality (VR) applications or augmented reality (AR) applications.

In at least one embodiment, platform controller hub 2930 enables peripherals to connect to memory device 2920 and processor 2902 via a high-speed I/O bus. In at least one embodiment, I/O peripherals include, but are not limited to, an audio controller 2946, a network controller 2934, a firmware interface 2928, a wireless transceiver 2926, touch sensors 2925, a data storage device 2924 (e.g., hard disk drive, flash memory, etc.). In at least one embodiment, data storage device 2924 can connect via a storage interface (e.g., SATA) or via a peripheral bus, such as a Peripheral Component Interconnect bus (e.g., PCI, PCI Express). In at least one embodiment, touch sensors 2925 can include touch screen sensors, pressure sensors, or fingerprint sensors. In at least one embodiment, wireless transceiver 2926 can be a Wi-Fi transceiver, a Bluetooth transceiver, or a mobile network transceiver such as a 3G, 4G, or Long Term Evolution (LTE) transceiver. In at least one embodiment, firmware interface 2928 enables communication with system firmware, and can be, for example, a unified extensible firmware interface (UEFI). In at least one embodiment, network controller 2934 can enable a network connection to a wired network. In at least one embodiment, a high-performance network controller (not shown) couples with interface bus 2910. In at least one embodiment, audio controller 2946 is a multi-channel high definition audio controller. In at least one embodiment, system 2900 includes an optional legacy I/O controller 2940 for coupling legacy (e.g., Personal System 2 (PS/2)) devices to system. In at least one embodiment, platform controller hub 2930 can also connect to one or more Universal Serial Bus (USB) controllers 2942 connect input devices, such as keyboard and mouse 2943 combinations, a camera 2944, or other USB input devices.

In at least one embodiment, an instance of memory controller 2916 and platform controller hub 2930 may be integrated into a discreet external graphics processor, such as external graphics processor 2912. In at least one embodiment, platform controller hub 2930 and/or memory controller 2916 may be external to one or more processor(s) 2902. For example, in at least one embodiment, system 2900 can include an external memory controller 2916 and platform controller hub 2930, which may be configured as a memory controller hub and peripheral controller hub within a system chipset that is in communication with processor(s) 2902.

In at least one embodiment, at least one component shown or described with respect to FIG. 29 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics processor 2908 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics processor 2908 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300. In at least one embodiment, processor core 2907 executes a kernel launch function that passes parameters to at least one kernel on graphics processor 2908 that performs rate matching described in connection with FIGS. 1-13 .

FIG. 30 is a block diagram of a processor 3000 having one or more processor cores 3002A-3002N, an integrated memory controller 3014, and an integrated graphics processor 3008, according to at least one embodiment. In at least one embodiment, processor 3000 can include additional cores up to and including additional core 3002N represented by dashed lined boxes. In at least one embodiment, each of processor cores 3002A-3002N includes one or more internal cache units 3004A-3004N. In at least one embodiment, each processor core also has access to one or more shared cached units 3006.

In at least one embodiment, internal cache units 3004A-3004N and shared cache units 3006 represent a cache memory hierarchy within processor 3000. In at least one embodiment, cache memory units 3004A-3004N may include at least one level of instruction and data cache within each processor core and one or more levels of shared mid-level cache, such as a Level 2 (L2), Level 3 (L3), Level 4 (L4), or other levels of cache, where a highest level of cache before external memory is classified as an LLC. In at least one embodiment, cache coherency logic maintains coherency between various cache units 3006 and 3004A-3004N.

In at least one embodiment, processor 3000 may also include a set of one or more bus controller units 3016 and a system agent core 3010. In at least one embodiment, one or more bus controller units 3016 manage a set of peripheral buses, such as one or more PCI or PCI express busses. In at least one embodiment, system agent core 3010 provides management functionality for various processor components. In at least one embodiment, system agent core 3010 includes one or more integrated memory controllers 3014 to manage access to various external memory devices (not shown).

In at least one embodiment, one or more of processor cores 3002A-3002N include support for simultaneous multi-threading. In at least one embodiment, system agent core 3010 includes components for coordinating and operating cores 3002A-3002N during multi-threaded processing. In at least one embodiment, system agent core 3010 may additionally include a power control unit (PCU), which includes logic and components to regulate one or more power states of processor cores 3002A-3002N and graphics processor 3008.

In at least one embodiment, processor 3000 additionally includes graphics processor 3008 to execute graphics processing operations. In at least one embodiment, graphics processor 3008 couples with shared cache units 3006, and system agent core 3010, including one or more integrated memory controllers 3014. In at least one embodiment, system agent core 3010 also includes a display controller 3011 to drive graphics processor output to one or more coupled displays. In at least one embodiment, display controller 3011 may also be a separate module coupled with graphics processor 3008 via at least one interconnect, or may be integrated within graphics processor 3008.

In at least one embodiment, a ring based interconnect unit 3012 is used to couple internal components of processor 3000. In at least one embodiment, an alternative interconnect unit may be used, such as a point-to-point interconnect, a switched interconnect, or other techniques. In at least one embodiment, graphics processor 3008 couples with ring interconnect 3012 via an I/O link 3013.

In at least one embodiment, I/O link 3013 represents at least one of multiple varieties of I/O interconnects, including an on package I/O interconnect which facilitates communication between various processor components and a high-performance embedded memory module 3018, such as an eDRAM module. In at least one embodiment, each of processor cores 3002A-3002N and graphics processor 3008 use embedded memory modules 3018 as a shared Last Level Cache.

In at least one embodiment, processor cores 3002A-3002N are homogenous cores executing a common instruction set architecture. In at least one embodiment, processor cores 3002A-3002N are heterogeneous in terms of instruction set architecture (ISA), where one or more of processor cores 3002A-3002N execute a common instruction set, while one or more other cores of processor cores 3002A-30-02N executes a subset of a common instruction set or a different instruction set. In at least one embodiment, processor cores 3002A-3002N are heterogeneous in terms of microarchitecture, where one or more cores having a relatively higher power consumption couple with one or more power cores having a lower power consumption. In at least one embodiment, processor 3000 can be implemented on one or more chips or as an SoC integrated circuit.

In at least one embodiment, at least one component shown or described with respect to FIG. 30 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics processor 3008 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics processor 3008 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300. In at least one embodiment, at least one processor core 3002 executes a kernel launch function that passes parameters to at least one kernel on graphics processor 3008 that performs rate matching described in connection with FIGS. 1-13 .

FIG. 31 is a block diagram of a graphics processor 3100, which may be a discrete graphics processing unit, or may be a graphics processor integrated with a plurality of processing cores. In at least one embodiment, graphics processor 3100 communicates via a memory mapped I/O interface to registers on graphics processor 3100 and with commands placed into memory. In at least one embodiment, graphics processor 3100 includes a memory interface 3114 to access memory. In at least one embodiment, memory interface 3114 is an interface to local memory, one or more internal caches, one or more shared external caches, and/or to system memory.

In at least one embodiment, graphics processor 3100 also includes a display controller 3102 to drive display output data to a display device 3120. In at least one embodiment, display controller 3102 includes hardware for one or more overlay planes for display device 3120 and composition of multiple layers of video or user interface elements. In at least one embodiment, display device 3120 can be an internal or external display device. In at least one embodiment, display device 3120 is a head mounted display device, such as a virtual reality (VR) display device or an augmented reality (AR) display device. In at least one embodiment, graphics processor 3100 includes a video codec engine 3106 to encode, decode, or transcode media to, from, or between one or more media encoding formats, including, but not limited to Moving Picture Experts Group (MPEG) formats such as MPEG-2, Advanced Video Coding (AVC) formats such as H.264/MPEG-4 AVC, as well as the Society of Motion Picture & Television Engineers (SMPTE) 421M/VC-1, and Joint Photographic Experts Group (JPEG) formats such as JPEG, and Motion JPEG (MJPEG) formats.

In at least one embodiment, graphics processor 3100 includes a block image transfer (BLIT) engine 3104 to perform two-dimensional (2D) rasterizer operations including, for example, bit-boundary block transfers. However, in at least one embodiment, 2D graphics operations are performed using one or more components of graphics processing engine (GPE) 3110. In at least one embodiment, GPE 3110 is a compute engine for performing graphics operations, including three-dimensional (3D) graphics operations and media operations.

In at least one embodiment, GPE 3110 includes a 3D pipeline 3112 for performing 3D operations, such as rendering three-dimensional images and scenes using processing functions that act upon 3D primitive shapes (e.g., rectangle, triangle, etc.). 3D pipeline 3112 includes programmable and fixed function elements that perform various tasks and/or spawn execution threads to a 3D/Media sub-system 3115. While 3D pipeline 3112 can be used to perform media operations, in at least one embodiment, GPE 3110 also includes a media pipeline 3116 that is used to perform media operations, such as video post-processing and image enhancement.

In at least one embodiment, media pipeline 3116 includes fixed function or programmable logic units to perform one or more specialized media operations, such as video decode acceleration, video de-interlacing, and video encode acceleration in place of, or on behalf of video codec engine 3106. In at least one embodiment, media pipeline 3116 additionally includes a thread spawning unit to spawn threads for execution on 3D/Media sub-system 3115. In at least one embodiment, spawned threads perform computations for media operations on one or more graphics execution units included in 3D/Media sub-system 3115.

In at least one embodiment, 3D/Media subsystem 3115 includes logic for executing threads spawned by 3D pipeline 3112 and media pipeline 3116. In at least one embodiment, 3D pipeline 3112 and media pipeline 3116 send thread execution requests to 3D/Media subsystem 3115, which includes thread dispatch logic for arbitrating and dispatching various requests to available thread execution resources. In at least one embodiment, execution resources include an array of graphics execution units to process 3D and media threads. In at least one embodiment, 3D/Media subsystem 3115 includes one or more internal caches for thread instructions and data. In at least one embodiment, subsystem 3115 also includes shared memory, including registers and addressable memory, to share data between threads and to store output data.

In at least one embodiment, at least one component shown or described with respect to FIG. 31 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics processor 3100 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics processor 3100 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 32 is a block diagram of a graphics processing engine 3210 of a graphics processor in accordance with at least one embodiment. In at least one embodiment, graphics processing engine (GPE) 3210 is a version of GPE 3110 shown in FIG. 31 . In at least one embodiment, media pipeline 3216 is optional and may not be explicitly included within GPE 3210. In at least one embodiment, a separate media and/or image processor is coupled to GPE 3210.

In at least one embodiment, GPE 3210 is coupled to or includes a command streamer 3203, which provides a command stream to 3D pipeline 3212 and/or media pipelines 3216. In at least one embodiment, command streamer 3203 is coupled to memory, which can be system memory, or one or more of internal cache memory and shared cache memory. In at least one embodiment, command streamer 3203 receives commands from memory and sends commands to 3D pipeline 3212 and/or media pipeline 3216. In at least one embodiment, commands are instructions, primitives, or micro-operations fetched from a ring buffer, which stores commands for 3D pipeline 3212 and media pipeline 3216. In at least one embodiment, a ring buffer can additionally include batch command buffers storing batches of multiple commands. In at least one embodiment, commands for 3D pipeline 3212 can also include references to data stored in memory, such as but not limited to vertex and geometry data for 3D pipeline 3212 and/or image data and memory objects for media pipeline 3216. In at least one embodiment, 3D pipeline 3212 and media pipeline 3216 process commands and data by performing operations or by dispatching one or more execution threads to a graphics core array 3214. In at least one embodiment graphics core array 3214 includes one or more blocks of graphics cores (e.g., graphics core(s) 3215A, graphics core(s) 3215B), each block including one or more graphics cores. In at least one embodiment, each graphics core includes a set of graphics execution resources that includes general-purpose and graphics specific execution logic to perform graphics and compute operations, as well as fixed function texture processing and/or machine learning and artificial intelligence acceleration logic.

In at least one embodiment, 3D pipeline 3212 includes fixed function and programmable logic to process one or more shader programs, such as vertex shaders, geometry shaders, pixel shaders, fragment shaders, compute shaders, or other shader programs, by processing instructions and dispatching execution threads to graphics core array 3214. In at least one embodiment, graphics core array 3214 provides a unified block of execution resources for use in processing shader programs. In at least one embodiment, multi-purpose execution logic (e.g., execution units) within graphics core(s) 3215A-3215B of graphic core array 3214 includes support for various 3D API shader languages and can execute multiple simultaneous execution threads associated with multiple shaders.

In at least one embodiment, graphics core array 3214 also includes execution logic to perform media functions, such as video and/or image processing. In at least one embodiment, execution units additionally include general-purpose logic that is programmable to perform parallel general-purpose computational operations, in addition to graphics processing operations.

In at least one embodiment, output data generated by threads executing on graphics core array 3214 can output data to memory in a unified return buffer (URB) 3218. URB 3218 can store data for multiple threads. In at least one embodiment, URB 3218 may be used to send data between different threads executing on graphics core array 3214. In at least one embodiment, URB 3218 may additionally be used for synchronization between threads on graphics core array 3214 and fixed function logic within shared function logic 3220.

In at least one embodiment, graphics core array 3214 is scalable, such that graphics core array 3214 includes a variable number of graphics cores, each having a variable number of execution units based on a target power and performance level of GPE 3210. In at least one embodiment, execution resources are dynamically scalable, such that execution resources may be enabled or disabled as needed.

In at least one embodiment, graphics core array 3214 is coupled to shared function logic 3220 that includes multiple resources that are shared between graphics cores in graphics core array 3214. In at least one embodiment, shared functions performed by shared function logic 3220 are embodied in hardware logic units that provide specialized supplemental functionality to graphics core array 3214. In at least one embodiment, shared function logic 3220 includes but is not limited to sampler 3221, math 3222, and inter-thread communication (ITC) 3223 logic. In at least one embodiment, one or more cache(s) 3225 are in included in or couple to shared function logic 3220.

In at least one embodiment, a shared function is used if demand for a specialized function is insufficient for inclusion within graphics core array 3214. In at least one embodiment, a single instantiation of a specialized function is used in shared function logic 3220 and shared among other execution resources within graphics core array 3214. In at least one embodiment, specific shared functions within shared function logic 3220 that are used extensively by graphics core array 3214 may be included within shared function logic 3216 within graphics core array 3214. In at least one embodiment, shared function logic 3216 within graphics core array 3214 can include some or all logic within shared function logic 3220. In at least one embodiment, all logic elements within shared function logic 3220 may be duplicated within shared function logic 3216 of graphics core array 3214. In at least one embodiment, shared function logic 3220 is excluded in favor of shared function logic 3216 within graphics core array 3214.

In at least one embodiment, at least one component shown or described with respect to FIG. 32 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics processing engine 3210 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics processing engine 3210 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 33 is a block diagram of hardware logic of a graphics processor core 3300, according to at least one embodiment described herein. In at least one embodiment, graphics processor core 3300 is included within a graphics core array. In at least one embodiment, graphics processor core 3300, sometimes referred to as a core slice, can be one or multiple graphics cores within a modular graphics processor. In at least one embodiment, graphics processor core 3300 is exemplary of one graphics core slice, and a graphics processor as described herein may include multiple graphics core slices based on target power and performance envelopes. In at least one embodiment, each graphics core 3300 can include a fixed function block 3330 coupled with multiple sub-cores 3301A-3301F, also referred to as sub-slices, that include modular blocks of general-purpose and fixed function logic.

In at least one embodiment, fixed function block 3330 includes a geometry/fixed function pipeline 3336 that can be shared by all sub-cores in graphics processor 3300, for example, in lower performance and/or lower power graphics processor implementations. In at least one embodiment, geometry/fixed function pipeline 3336 includes a 3D fixed function pipeline, a video front-end unit, a thread spawner and thread dispatcher, and a unified return buffer manager, which manages unified return buffers.

In at least one embodiment fixed function block 3330 also includes a graphics SoC interface 3337, a graphics microcontroller 3338, and a media pipeline 3339. Graphics SoC interface 3337 provides an interface between graphics core 3300 and other processor cores within a system on a chip integrated circuit. In at least one embodiment, graphics microcontroller 3338 is a programmable sub-processor that is configurable to manage various functions of graphics processor 3300, including thread dispatch, scheduling, and pre-emption. In at least one embodiment, media pipeline 3339 includes logic to facilitate decoding, encoding, pre-processing, and/or post-processing of multimedia data, including image and video data. In at least one embodiment, media pipeline 3339 implement media operations via requests to compute or sampling logic within sub-cores 3301-3301F.

In at least one embodiment, SoC interface 3337 enables graphics core 3300 to communicate with general-purpose application processor cores (e.g., CPUs) and/or other components within an SoC, including memory hierarchy elements such as a shared last level cache memory, system RAM, and/or embedded on-chip or on-package DRAM. In at least one embodiment, SoC interface 3337 can also enable communication with fixed function devices within an SoC, such as camera imaging pipelines, and enables use of and/or implements global memory atomics that may be shared between graphics core 3300 and CPUs within an SoC. In at least one embodiment, SoC interface 3337 can also implement power management controls for graphics core 3300 and enable an interface between a clock domain of graphic core 3300 and other clock domains within an SoC. In at least one embodiment, SoC interface 3337 enables receipt of command buffers from a command streamer and global thread dispatcher that are configured to provide commands and instructions to each of one or more graphics cores within a graphics processor. In at least one embodiment, commands and instructions can be dispatched to media pipeline 3339, when media operations are to be performed, or a geometry and fixed function pipeline (e.g., geometry and fixed function pipeline 3336, geometry and fixed function pipeline 3314) when graphics processing operations are to be performed.

In at least one embodiment, graphics microcontroller 3338 can be configured to perform various scheduling and management tasks for graphics core 3300. In at least one embodiment, graphics microcontroller 3338 can perform graphics and/or compute workload scheduling on various graphics parallel engines within execution unit (EU) arrays 3302A-3302F, 3304A-3304F within sub-cores 3301A-3301F. In at least one embodiment, host software executing on a CPU core of an SoC including graphics core 3300 can submit workloads one of multiple graphic processor doorbells, which invokes a scheduling operation on an appropriate graphics engine. In at least one embodiment, scheduling operations include determining which workload to run next, submitting a workload to a command streamer, pre-empting existing workloads running on an engine, monitoring progress of a workload, and notifying host software when a workload is complete. In at least one embodiment, graphics microcontroller 3338 can also facilitate low-power or idle states for graphics core 3300, providing graphics core 3300 with an ability to save and restore registers within graphics core 3300 across low-power state transitions independently from an operating system and/or graphics driver software on a system.

In at least one embodiment, graphics core 3300 may have greater than or fewer than illustrated sub-cores 3301A-3301F, up to N modular sub-cores. For each set of N sub-cores, in at least one embodiment, graphics core 3300 can also include shared function logic 3310, shared and/or cache memory 3312, a geometry/fixed function pipeline 3314, as well as additional fixed function logic 3316 to accelerate various graphics and compute processing operations. In at least one embodiment, shared function logic 3310 can include logic units (e.g., sampler, math, and/or inter-thread communication logic) that can be shared by each N sub-cores within graphics core 3300. Shared and/or cache memory 3312 can be a last-level cache for N sub-cores 3301A-3301F within graphics core 3300 and can also serve as shared memory that is accessible by multiple sub-cores. In at least one embodiment, geometry/fixed function pipeline 3314 can be included instead of geometry/fixed function pipeline 3336 within fixed function block 3330 and can include same or similar logic units.

In at least one embodiment, graphics core 3300 includes additional fixed function logic 3316 that can include various fixed function acceleration logic for use by graphics core 3300. In at least one embodiment, additional fixed function logic 3316 includes an additional geometry pipeline for use in position only shading. In position-only shading, at least two geometry pipelines exist, whereas in a full geometry pipeline within geometry/fixed function pipeline 3316, 3336, and a cull pipeline, which is an additional geometry pipeline which may be included within additional fixed function logic 3316. In at least one embodiment, cull pipeline is a trimmed down version of a full geometry pipeline. In at least one embodiment, a full pipeline and a cull pipeline can execute different instances of an application, each instance having a separate context. In at least one embodiment, position only shading can hide long cull runs of discarded triangles, enabling shading to be completed earlier in some instances. For example, in at least one embodiment, cull pipeline logic within additional fixed function logic 3316 can execute position shaders in parallel with a main application and generally generates critical results faster than a full pipeline, as cull pipeline fetches and shades position attribute of vertices, without performing rasterization and rendering of pixels to a frame buffer. In at least one embodiment, cull pipeline can use generated critical results to compute visibility information for all triangles without regard to whether those triangles are culled. In at least one embodiment, full pipeline (which in this instance may be referred to as a replay pipeline) can consume visibility information to skip culled triangles to shade only visible triangles that are finally passed to a rasterization phase.

In at least one embodiment, additional fixed function logic 3316 can also include machine-learning acceleration logic, such as fixed function matrix multiplication logic, for implementations including optimizations for machine learning training or inferencing.

In at least one embodiment, within each graphics sub-core 3301A-3301F includes a set of execution resources that may be used to perform graphics, media, and compute operations in response to requests by graphics pipeline, media pipeline, or shader programs. In at least one embodiment, graphics sub-cores 3301A-3301F include multiple EU arrays 3302A-3302F, 3304A-3304F, thread dispatch and inter-thread communication (TD/IC) logic 3303A-3303F, a 3D (e.g., texture) sampler 3305A-3305F, a media sampler 3306A-3306F, a shader processor 3307A-3307F, and shared local memory (SLM) 3308A-3308F. EU arrays 3302A-3302F, 3304A-3304F each include multiple execution units, which are general-purpose graphics processing units capable of performing floating-point and integer/fixed-point logic operations in service of a graphics, media, or compute operation, including graphics, media, or compute shader programs. In at least one embodiment, TD/IC logic 3303A-3303F performs local thread dispatch and thread control operations for execution units within a sub-core and facilitate communication between threads executing on execution units of a sub-core. In at least one embodiment, 3D sampler 3305A-3305F can read texture or other 3D graphics related data into memory. In at least one embodiment, 3D sampler can read texture data differently based on a configured sample state and texture format associated with a given texture. In at least one embodiment, media sampler 3306A-3306F can perform similar read operations based on a type and format associated with media data. In at least one embodiment, each graphics sub-core 3301A-3301F can alternately include a unified 3D and media sampler. In at least one embodiment, threads executing on execution units within each of sub-cores 3301A-3301F can make use of shared local memory 3308A-3308F within each sub-core, to enable threads executing within a thread group to execute using a common pool of on-chip memory.

In at least one embodiment, at least one component shown or described with respect to FIG. 33 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one graphics processor core 3300 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one graphics processor core 3300 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIGS. 34A and 34B illustrate thread execution logic 3400 including an array of processing elements of a graphics processor core according to at least one embodiment. FIG. 34A illustrates at least one embodiment, in which thread execution logic 3400 is used. FIG. 34B illustrates exemplary internal details of an execution unit, according to at least one embodiment.

As illustrated in FIG. 34A, in at least one embodiment, thread execution logic 3400 includes a shader processor 3402, a thread dispatcher 3404, instruction cache 3406, a scalable execution unit array including a plurality of execution units 3408A-3408N, a sampler 3410, a data cache 3412, and a data port 3414. In at least one embodiment a scalable execution unit array can dynamically scale by enabling or disabling one or more execution units (e.g., any of execution unit 3408A, 3408B, 3408C, 3408D, through 3408N-1 and 3408N) based on computational requirements of a workload, for example. In at least one embodiment, scalable execution units are interconnected via an interconnect fabric that links to each of execution unit. In at least one embodiment, thread execution logic 3400 includes one or more connections to memory, such as system memory or cache memory, through one or more of instruction cache 3406, data port 3414, sampler 3410, and execution units 3408A-3408N. In at least one embodiment, each execution unit (e.g., 3408A) is a stand-alone programmable general-purpose computational unit that is capable of executing multiple simultaneous hardware threads while processing multiple data elements in parallel for each thread. In at least one embodiment, array of execution units 3408A-3408N is scalable to include any number individual execution units.

In at least one embodiment, execution units 3408A-3408N are primarily used to execute shader programs. In at least one embodiment, shader processor 3402 can process various shader programs and dispatch execution threads associated with shader programs via a thread dispatcher 3404. In at least one embodiment, thread dispatcher 3404 includes logic to arbitrate thread initiation requests from graphics and media pipelines and instantiate requested threads on one or more execution units in execution units 3408A-3408N. For example, in at least one embodiment, a geometry pipeline can dispatch vertex, tessellation, or geometry shaders to thread execution logic for processing. In at least one embodiment, thread dispatcher 3404 can also process runtime thread spawning requests from executing shader programs.

In at least one embodiment, execution units 3408A-3408N support an instruction set that includes native support for many standard 3D graphics shader instructions, such that shader programs from graphics libraries (e.g., Direct 3D and OpenGL) are executed with a minimal translation. In at least one embodiment, execution units support vertex and geometry processing (e.g., vertex programs, geometry programs, vertex shaders), pixel processing (e.g., pixel shaders, fragment shaders) and general-purpose processing (e.g., compute and media shaders). In at least one embodiment, each of execution units 3408A-3408N, which include one or more arithmetic logic units (ALUs), is capable of multi-issue single instruction multiple data (SIMD) execution and multi-threaded operation enables an efficient execution environment despite higher latency memory accesses. In at least one embodiment, each hardware thread within each execution unit has a dedicated high-bandwidth register file and associated independent thread-state. In at least one embodiment, execution is multi-issue per clock to pipelines capable of integer, single and double precision floating point operations, SIMD branch capability, logical operations, transcendental operations, and other miscellaneous operations. In at least one embodiment, while waiting for data from memory or one of shared functions, dependency logic within execution units 3408A-3408N causes a waiting thread to sleep until requested data has been returned. In at least one embodiment, while a waiting thread is sleeping, hardware resources may be devoted to processing other threads. For example, in at least one embodiment, during a delay associated with a vertex shader operation, an execution unit can perform operations for a pixel shader, fragment shader, or another type of shader program, including a different vertex shader.

In at least one embodiment, each execution unit in execution units 3408A-3408N operates on arrays of data elements. In at least one embodiment, a number of data elements is “execution size,” or number of channels for an instruction. In at least one embodiment, an execution channel is a logical unit of execution for data element access, masking, and flow control within instructions. In at least one embodiment, a number of channels may be independent of a number of physical Arithmetic Logic Units (ALUs) or Floating Point Units (FPUs) for a particular graphics processor. In at least one embodiment, execution units 3408A-3408N support integer and floating-point data types.

In at least one embodiment, an execution unit instruction set includes SIMD instructions. In at least one embodiment, various data elements can be stored as a packed data type in a register and execution unit will process various elements based on data size of elements. For example, in at least one embodiment, when operating on a 256-bit wide vector, 256 bits of a vector are stored in a register and an execution unit operates on a vector as four separate 64-bit packed data elements (Quad-Word (QW) size data elements), eight separate 32-bit packed data elements (Double Word (DW) size data elements), sixteen separate 16-bit packed data elements (Word (W) size data elements), or thirty-two separate 8-bit data elements (byte (B) size data elements). However, in at least one embodiment, different vector widths and register sizes are possible.

In at least one embodiment, one or more execution units can be combined into a fused execution unit 3409A-3409N having thread control logic (3407A-3407N) that is common to fused EUs. In at least one embodiment, multiple EUs can be fused into an EU group. In at least one embodiment, each EU in fused EU group can be configured to execute a separate SIMD hardware thread. The number of EUs in a fused EU group can vary according to various embodiments. In at least one embodiment, various SIID widths can be performed per-EU, including but not limited to SIMD8, SIMD16, and SIMD32. In at least one embodiment, each fused graphics execution unit 3409A-3409N includes at least two execution units. For example, in at least one embodiment, fused execution unit 3409A includes a first EU 3408A, second EU 3408B, and thread control logic 3407A that is common to first EU 3408A and second EU 3408B. In at least one embodiment, thread control logic 3407A controls threads executed on fused graphics execution unit 3409A, allowing each EU within fused execution units 3409A-3409N to execute using a common instruction pointer register.

In at least one embodiment, one or more internal instruction caches (e.g., 3406) are included in thread execution logic 3400 to cache thread instructions for execution units. In at least one embodiment, one or more data caches (e.g., 3412) are included to cache thread data during thread execution. In at least one embodiment, a sampler 3410 is included to provide texture sampling for 3D operations and media sampling for media operations. In at least one embodiment, sampler 3410 includes specialized texture or media sampling functionality to process texture or media data during sampling process before providing sampled data to an execution unit.

During execution, in at least one embodiment, graphics and media pipelines send thread initiation requests to thread execution logic 3400 via thread spawning and dispatch logic. In at least one embodiment, once a group of geometric objects has been processed and rasterized into pixel data, pixel processor logic (e.g., pixel shader logic, fragment shader logic, etc.) within shader processor 3402 is invoked to further compute output information and cause results to be written to output surfaces (e.g., color buffers, depth buffers, stencil buffers, etc.). In at least one embodiment, a pixel shader or fragment shader calculates values of various vertex attributes that are to be interpolated across a rasterized object. In at least one embodiment, pixel processor logic within shader processor 3402 then executes an application programming interface (API)-supplied pixel or fragment shader program. In at least one embodiment, to execute a shader program, shader processor 3402 dispatches threads to an execution unit (e.g., 3408A) via thread dispatcher 3404. In at least one embodiment, shader processor 3402 uses texture sampling logic in sampler 3410 to access texture data in texture maps stored in memory. In at least one embodiment, arithmetic operations on texture data and input geometry data compute pixel color data for each geometric fragment, or discards one or more pixels from further processing.

In at least one embodiment, data port 3414 provides a memory access mechanism for thread execution logic 3400 to output processed data to memory for further processing on a graphics processor output pipeline. In at least one embodiment, data port 3414 includes or couples to one or more cache memories (e.g., data cache 3412) to cache data for memory access via a data port.

As illustrated in FIG. 34B, in at least one embodiment, a graphics execution unit 3408 can include an instruction fetch unit 3437, a general register file array (GRF) 3424, an architectural register file array (ARF) 3426, a thread arbiter 3422, a send unit 3430, a branch unit 3432, a set of SIMD floating point units (FPUs) 3434, and In at least one embodiment a set of dedicated integer SIMD ALUs 3435. In at least one embodiment, GRF 3424 and ARF 3426 includes a set of general register files and architecture register files associated with each simultaneous hardware thread that may be active in graphics execution unit 3408. In at least one embodiment, per thread architectural state is maintained in ARF 3426, while data used during thread execution is stored in GRF 3424. In at least one embodiment, execution state of each thread, including instruction pointers for each thread, can be held in thread-specific registers in ARF 3426.

In at least one embodiment, graphics execution unit 3408 has an architecture that is a combination of Simultaneous Multi-Threading (SMT) and fine-grained Interleaved Multi-Threading (IMT). In at least one embodiment, architecture has a modular configuration that can be fine-tuned at design time based on a target number of simultaneous threads and number of registers per execution unit, where execution unit resources are divided across logic used to execute multiple simultaneous threads.

In at least one embodiment, graphics execution unit 3408 can co-issue multiple instructions, which may each be different instructions. In at least one embodiment, thread arbiter 3422 of graphics execution unit thread 3408 can dispatch instructions to one of send unit 3430, branch unit 3442, or SIMD FPU(s) 3434 for execution. In at least one embodiment, each execution thread can access 128 general-purpose registers within GRF 3424, where each register can store 32 bytes, accessible as a SIMD 8-element vector of 32-bit data elements. In at least one embodiment, each execution unit thread has access to 4 Kbytes within GRF 3424, although embodiments are not so limited, and greater or fewer register resources may be provided in other embodiments. In at least one embodiment, up to seven threads can execute simultaneously, although a number of threads per execution unit can also vary according to embodiments. In at least one embodiment, in which seven threads may access 4 Kbytes, GRF 3424 can store a total of 28 Kbytes. In at least one embodiment, flexible addressing modes can permit registers to be addressed together to build effectively wider registers or to represent strided rectangular block data structures.

In at least one embodiment, memory operations, sampler operations, and other longer-latency system communications are dispatched via “send” instructions that are executed by message passing send unit 3430. In at least one embodiment, branch instructions are dispatched to a dedicated branch unit 3432 to facilitate SIMD divergence and eventual convergence.

In at least one embodiment graphics execution unit 3408 includes one or more SIMD floating point units (FPU(s)) 3434 to perform floating-point operations. In at least one embodiment, FPU(s) 3434 also support integer computation. In at least one embodiment FPU(s) 3434 can SIMD execute up to M number of 32-bit floating-point (or integer) operations, or SIMD execute up to 2M 16-bit integer or 16-bit floating-point operations. In at least one embodiment, at least one of FPU(s) provides extended math capability to support high-throughput transcendental math functions and double precision 64-bit floating-point. In at least one embodiment, a set of 8-bit integer SIMD ALUs 3435 are also present, and may be specifically optimized to perform operations associated with machine learning computations.

In at least one embodiment, arrays of multiple instances of graphics execution unit 3408 can be instantiated in a graphics sub-core grouping (e.g., a sub-slice). In at least one embodiment execution unit 3408 can execute instructions across a plurality of execution channels. In at least one embodiment, each thread executed on graphics execution unit 3408 is executed on a different channel.

In at least one embodiment, at least one component shown or described with respect to FIGS. 34A and 34B is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one thread execution logic 3400 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one thread execution logic 3400 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 35 illustrates a parallel processing unit (“PPU”) 3500, according to at least one embodiment. In at least one embodiment, PPU 3500 is configured with machine-readable code that, if executed by PPU 3500, causes PPU 3500 to perform some or all of processes and techniques described throughout this disclosure. In at least one embodiment, PPU 3500 is a multi-threaded processor that is implemented on one or more integrated circuit devices and that utilizes multithreading as a latency-hiding technique designed to process computer-readable instructions (also referred to as machine-readable instructions or simply instructions) on multiple threads in parallel. In at least one embodiment, a thread refers to a thread of execution and is an instantiation of a set of instructions configured to be executed by PPU 3500. In at least one embodiment, PPU 3500 is a graphics processing unit (“GPU”) configured to implement a graphics rendering pipeline for processing three-dimensional (“3D”) graphics data in order to generate two-dimensional (“2D”) image data for display on a display device such as a liquid crystal display (“LCD”) device. In at least one embodiment, PPU 3500 is utilized to perform computations such as linear algebra operations and machine-learning operations. FIG. 35 illustrates an example parallel processor for illustrative purposes only and should be construed as a non-limiting example of processor architectures contemplated within scope of this disclosure and that any suitable processor may be employed to supplement and/or substitute for same.

In at least one embodiment, one or more PPUs 3500 are configured to accelerate High Performance Computing (“HPC”), data center, and machine learning applications. In at least one embodiment, PPU 3500 is configured to accelerate deep learning systems and applications including following non-limiting examples: autonomous vehicle platforms, deep learning, high-accuracy speech, image, text recognition systems, intelligent video analytics, molecular simulations, drug discovery, disease diagnosis, weather forecasting, big data analytics, astronomy, molecular dynamics simulation, financial modeling, robotics, factory automation, real-time language translation, online search optimizations, and personalized user recommendations, and more.

In at least one embodiment, PPU 3500 includes, without limitation, an Input/Output (“I/O”) unit 3506, a front-end unit 3510, a scheduler unit 3512, a work distribution unit 3514, a hub 3516, a crossbar (“Xbar”) 3520, one or more general processing clusters (“GPCs”) 3518, and one or more partition units (“memory partition units”) 3522. In at least one embodiment, PPU 3500 is connected to a host processor or other PPUs 3500 via one or more high-speed GPU interconnects (“GPU interconnects”) 3508. In at least one embodiment, PPU 3500 is connected to a host processor or other peripheral devices via an interconnect 3502. In at least one embodiment, PPU 3500 is connected to a local memory comprising one or more memory devices (“memory”) 3504. In at least one embodiment, memory devices 3504 include, without limitation, one or more dynamic random access memory (“DRAM”) devices. In at least one embodiment, one or more DRAM devices are configured and/or configurable as high-bandwidth memory (“HBM”) subsystems, with multiple DRAM dies stacked within each device.

In at least one embodiment, high-speed GPU interconnect 3508 may refer to a wire-based multi-lane communications link that is used by systems to scale and include one or more PPUs 3500 combined with one or more central processing units (“CPUs”), supports cache coherence between PPUs 3500 and CPUs, and CPU mastering. In at least one embodiment, data and/or commands are transmitted by high-speed GPU interconnect 3508 through hub 3516 to/from other units of PPU 3500 such as one or more copy engines, video encoders, video decoders, power management units, and other components which may not be explicitly illustrated in FIG. 35 .

In at least one embodiment, I/O unit 3506 is configured to transmit and receive communications (e.g., commands, data) from a host processor (not illustrated in FIG. 35 ) over system bus 3502. In at least one embodiment, I/O unit 3506 communicates with host processor directly via system bus 3502 or through one or more intermediate devices such as a memory bridge. In at least one embodiment, I/O unit 3506 may communicate with one or more other processors, such as one or more of PPUs 3500 via system bus 3502. In at least one embodiment, I/O unit 3506 implements a Peripheral Component Interconnect Express (“PCIe”) interface for communications over a PCIe bus. In at least one embodiment, I/O unit 3506 implements interfaces for communicating with external devices.

In at least one embodiment, I/O unit 3506 decodes packets received via system bus 3502. In at least one embodiment, at least some packets represent commands configured to cause PPU 3500 to perform various operations. In at least one embodiment, I/O unit 3506 transmits decoded commands to various other units of PPU 3500 as specified by commands. In at least one embodiment, commands are transmitted to front-end unit 3510 and/or transmitted to hub 3516 or other units of PPU 3500 such as one or more copy engines, a video encoder, a video decoder, a power management unit, etc. (not explicitly illustrated in FIG. 35 ). In at least one embodiment, I/O unit 3506 is configured to route communications between and among various logical units of PPU 3500.

In at least one embodiment, a program executed by host processor encodes a command stream in a buffer that provides workloads to PPU 3500 for processing. In at least one embodiment, a workload comprises instructions and data to be processed by those instructions. In at least one embodiment, buffer is a region in a memory that is accessible (e.g., read/write) by both host processor and PPU 3500—a host interface unit may be configured to access buffer in a system memory connected to system bus 3502 via memory requests transmitted over system bus 3502 by I/O unit 3506. In at least one embodiment, host processor writes command stream to buffer and then transmits a pointer to start of command stream to PPU 3500 such that front-end unit 3510 receives pointers to one or more command streams and manages one or more command streams, reading commands from command streams and forwarding commands to various units of PPU 3500.

In at least one embodiment, front-end unit 3510 is coupled to scheduler unit 3512 that configures various GPCs 3518 to process tasks defined by one or more command streams. In at least one embodiment, scheduler unit 3512 is configured to track state information related to various tasks managed by scheduler unit 3512 where state information may indicate which of GPCs 3518 a task is assigned to, whether task is active or inactive, a priority level associated with task, and so forth. In at least one embodiment, scheduler unit 3512 manages execution of a plurality of tasks on one or more of GPCs 3518.

In at least one embodiment, scheduler unit 3512 is coupled to work distribution unit 3514 that is configured to dispatch tasks for execution on GPCs 3518. In at least one embodiment, work distribution unit 3514 tracks a number of scheduled tasks received from scheduler unit 3512 and work distribution unit 3514 manages a pending task pool and an active task pool for each of GPCs 3518. In at least one embodiment, pending task pool comprises a number of slots (e.g., 32 slots) that contain tasks assigned to be processed by a particular GPC 3518; active task pool may comprise a number of slots (e.g., 4 slots) for tasks that are actively being processed by GPCs 3518 such that as one of GPCs 3518 completes execution of a task, that task is evicted from active task pool for GPC 3518 and one of other tasks from pending task pool is selected and scheduled for execution on GPC 3518. In at least one embodiment, if an active task is idle on GPC 3518, such as while waiting for a data dependency to be resolved, then active task is evicted from GPC 3518 and returned to pending task pool while another task in pending task pool is selected and scheduled for execution on GPC 3518.

In at least one embodiment, work distribution unit 3514 communicates with one or more GPCs 3518 via XBar 3520. In at least one embodiment, XBar 3520 is an interconnect network that couples many of units of PPU 3500 to other units of PPU 3500 and can be configured to couple work distribution unit 3514 to a particular GPC 3518. In at least one embodiment, one or more other units of PPU 3500 may also be connected to XBar 3520 via hub 3516.

In at least one embodiment, tasks are managed by scheduler unit 3512 and dispatched to one of GPCs 3518 by work distribution unit 3514. GPC 3518 is configured to process task and generate results. In at least one embodiment, results may be consumed by other tasks within GPC 3518, routed to a different GPC 3518 via XBar 3520, or stored in memory 3504. In at least one embodiment, results can be written to memory 3504 via partition units 3522, which implement a memory interface for reading and writing data to/from memory 3504. In at least one embodiment, results can be transmitted to another PPU 3504 or CPU via high-speed GPU interconnect 3508. In at least one embodiment, PPU 3500 includes, without limitation, a number U of partition units 3522 that is equal to number of separate and distinct memory devices 3504 coupled to PPU 3500. In at least one embodiment, partition unit 3522 will be described in more detail herein in conjunction with FIG. 37 .

In at least one embodiment, a host processor executes a driver kernel that implements an application programming interface (“API”) that enables one or more applications executing on host processor to schedule operations for execution on PPU 3500. In at least one embodiment, multiple compute applications are simultaneously executed by PPU 3500 and PPU 3500 provides isolation, quality of service (“QoS”), and independent address spaces for multiple compute applications. In at least one embodiment, an application generates instructions (e.g., in form of API calls) that cause driver kernel to generate one or more tasks for execution by PPU 3500 and driver kernel outputs tasks to one or more streams being processed by PPU 3500. In at least one embodiment, each task comprises one or more groups of related threads, which may be referred to as a warp. In at least one embodiment, a warp comprises a plurality of related threads (e.g., 32 threads) that can be executed in parallel. In at least one embodiment, cooperating threads can refer to a plurality of threads including instructions to perform task and that exchange data through shared memory. In at least one embodiment, threads and cooperating threads are described in more detail, in accordance with at least one embodiment, in conjunction with FIG. 37 .

In at least one embodiment, at least one component shown or described with respect to FIG. 35 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, PPU 3500 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, PPU 3500 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 36 illustrates a general processing cluster (“GPC”) 3600, according to at least one embodiment. In at least one embodiment, GPC 3600 is GPC 3518 of FIG. 35 . In at least one embodiment, each GPC 3600 includes, without limitation, a number of hardware units for processing tasks and each GPC 3600 includes, without limitation, a pipeline manager 3602, a pre-raster operations unit (“PROP”) 3604, a raster engine 3608, a work distribution crossbar (“WDX”) 3616, a memory management unit (“MMU”) 3618, one or more Data Processing Clusters (“DPCs”) 3606, and any suitable combination of parts.

In at least one embodiment, operation of GPC 3600 is controlled by pipeline manager 3602. In at least one embodiment, pipeline manager 3602 manages configuration of one or more DPCs 3606 for processing tasks allocated to GPC 3600. In at least one embodiment, pipeline manager 3602 configures at least one of one or more DPCs 3606 to implement at least a portion of a graphics rendering pipeline. In at least one embodiment, DPC 3606 is configured to execute a vertex shader program on a programmable streaming multi-processor (“SM”) 3614. In at least one embodiment, pipeline manager 3602 is configured to route packets received from a work distribution unit to appropriate logical units within GPC 3600, in at least one embodiment, and some packets may be routed to fixed function hardware units in PROP 3604 and/or raster engine 3608 while other packets may be routed to DPCs 3606 for processing by a primitive engine 3612 or SM 3614. In at least one embodiment, pipeline manager 3602 configures at least one of DPCs 3606 to implement a neural network model and/or a computing pipeline.

In at least one embodiment, PROP unit 3604 is configured, in at least one embodiment, to route data generated by raster engine 3608 and DPCs 3606 to a Raster Operations (“ROP”) unit in partition unit 3522, described in more detail above in conjunction with FIG. 35 . In at least one embodiment, PROP unit 3604 is configured to perform optimizations for color blending, organize pixel data, perform address translations, and more. In at least one embodiment, raster engine 3608 includes, without limitation, a number of fixed function hardware units configured to perform various raster operations, in at least one embodiment, and raster engine 3608 includes, without limitation, a setup engine, a coarse raster engine, a culling engine, a clipping engine, a fine raster engine, a tile coalescing engine, and any suitable combination thereof. In at least one embodiment, setup engine receives transformed vertices and generates plane equations associated with geometric primitive defined by vertices; plane equations are transmitted to coarse raster engine to generate coverage information (e.g., an x, y coverage mask for a tile) for primitive; output of coarse raster engine is transmitted to culling engine where fragments associated with primitive that fail a z-test are culled, and transmitted to a clipping engine where fragments lying outside a viewing frustum are clipped. In at least one embodiment, fragments that survive clipping and culling are passed to fine raster engine to generate attributes for pixel fragments based on plane equations generated by setup engine. In at least one embodiment, output of raster engine 3608 comprises fragments to be processed by any suitable entity such as by a fragment shader implemented within DPC 3606.

In at least one embodiment, each DPC 3606 included in GPC 3600 comprise, without limitation, an M-Pipe Controller (“MPC”) 3610; primitive engine 3612; one or more SMs 3614; and any suitable combination thereof. In at least one embodiment, MPC 3610 controls operation of DPC 3606, routing packets received from pipeline manager 3602 to appropriate units in DPC 3606. In at least one embodiment, packets associated with a vertex are routed to primitive engine 3612, which is configured to fetch vertex attributes associated with vertex from memory; in contrast, packets associated with a shader program may be transmitted to SM 3614.

In at least one embodiment, SM 3614 comprises, without limitation, a programmable streaming processor that is configured to process tasks represented by a number of threads. In at least one embodiment, SM 3614 is multi-threaded and configured to execute a plurality of threads (e.g., 32 threads) from a particular group of threads concurrently and implements a Single-Instruction, Multiple-Data (“SIMD”) architecture where each thread in a group of threads (e.g., a warp) is configured to process a different set of data based on same set of instructions. In at least one embodiment, all threads in group of threads execute same instructions. In at least one embodiment, SM 3614 implements a Single-Instruction, Multiple Thread (“SIMT”) architecture wherein each thread in a group of threads is configured to process a different set of data based on same set of instructions, but where individual threads in group of threads are allowed to diverge during execution. In at least one embodiment, a program counter, call stack, and execution state is maintained for each warp, enabling concurrency between warps and serial execution within warps when threads within warp diverge. In another embodiment, a program counter, call stack, and execution state is maintained for each individual thread, enabling equal concurrency between all threads, within and between warps. In at least one embodiment, execution state is maintained for each individual thread and threads executing same instructions may be converged and executed in parallel for better efficiency. At least one embodiment of SM 3614 are described in more detail herein.

In at least one embodiment, MMU 3618 provides an interface between GPC 3600 and memory partition unit (e.g., partition unit 3522 of FIG. 35 ) and MMU 3618 provides translation of virtual addresses into physical addresses, memory protection, and arbitration of memory requests. In at least one embodiment, MMU 3618 provides one or more translation lookaside buffers (“TLBs”) for performing translation of virtual addresses into physical addresses in memory.

In at least one embodiment, at least one component shown or described with respect to FIG. 36 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one GPC 3600 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one GPC 3600 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 37 illustrates a memory partition unit 3700 of a parallel processing unit (“PPU”), in accordance with at least one embodiment. In at least one embodiment, memory partition unit 3700 includes, without limitation, a Raster Operations (“ROP”) unit 3702; a level two (“L2”) cache 3704; a memory interface 3706; and any suitable combination thereof. In at least one embodiment, memory interface 3706 is coupled to memory. In at least one embodiment, memory interface 3706 may implement 32, 64, 128, 1024-bit data buses, or like, for high-speed data transfer. In at least one embodiment, PPU incorporates U memory interfaces 3706, one memory interface 3706 per pair of partition units 3700, where each pair of partition units 3700 is connected to a corresponding memory device. For example, in at least one embodiment, PPU may be connected to up to Y memory devices, such as high bandwidth memory stacks or graphics double-data-rate, version 5, synchronous dynamic random access memory (“GDDR5 SDRAM”).

In at least one embodiment, memory interface 3706 implements a high bandwidth memory second generation (“HBM2”) memory interface and Y equals half U. In at least one embodiment, HBM2 memory stacks are located on same physical package as PPU, providing substantial power and area savings compared with conventional GDDR5 SDRAM systems. In at least one embodiment, each HBM2 stack includes, without limitation, four memory dies and Y equals 4, with each HBM2 stack including two 128-bit channels per die for a total of 8 channels and a data bus width of 1024 bits. In at least one embodiment, memory supports Single-Error Correcting Double-Error Detecting (“SECDED”) Error Correction Code (“ECC”) to protect data. ECC provides higher reliability for compute applications that are sensitive to data corruption.

In at least one embodiment, PPU implements a multi-level memory hierarchy. In at least one embodiment, memory partition unit 3700 supports a unified memory to provide a single unified virtual address space for central processing unit (“CPU”) and PPU memory, enabling data sharing between virtual memory systems. In at least one embodiment frequency of accesses by a PPU to memory located on other processors is traced to ensure that memory pages are moved to physical memory of PPU that is accessing pages more frequently. In at least one embodiment, high-speed GPU interconnect 3508 supports address translation services allowing PPU to directly access a CPU's page tables and providing full access to CPU memory by PPU.

In at least one embodiment, copy engines transfer data between multiple PPUs or between PPUs and CPUs. In at least one embodiment, copy engines can generate page faults for addresses that are not mapped into page tables and memory partition unit 3700 then services page faults, mapping addresses into page table, after which copy engine performs transfer. In at least one embodiment, memory is pinned (i.e., non-pageable) for multiple copy engine operations between multiple processors, substantially reducing available memory. In at least one embodiment, with hardware page faulting, addresses can be passed to copy engines without regard as to whether memory pages are resident, and copy process is transparent.

Data from memory 3504 of FIG. 35 or other system memory is fetched by memory partition unit 3700 and stored in L2 cache 3704, which is located on-chip and is shared between various GPCs, in accordance with at least one embodiment. Each memory partition unit 3700, in at least one embodiment, includes, without limitation, at least a portion of L2 cache associated with a corresponding memory device. In at least one embodiment, lower level caches are implemented in various units within GPCs. In at least one embodiment, each of SMs 3614 may implement a level one (“L1”) cache wherein L1 cache is private memory that is dedicated to a particular SM 3614 and data from L2 cache 3704 is fetched and stored in each of L1 caches for processing in functional units of SMs 3614. In at least one embodiment, L2 cache 3704 is coupled to memory interface 3706 and XBar 3520.

ROP unit 3702 performs graphics raster operations related to pixel color, such as color compression, pixel blending, and more, in at least one embodiment. ROP unit 3702, in at least one embodiment, implements depth testing in conjunction with raster engine 3608, receiving a depth for a sample location associated with a pixel fragment from culling engine of raster engine 3608. In at least one embodiment, depth is tested against a corresponding depth in a depth buffer for a sample location associated with fragment. In at least one embodiment, if fragment passes depth test for sample location, then ROP unit 3702 updates depth buffer and transmits a result of depth test to raster engine 3608. It will be appreciated that number of partition units 3700 may be different than number of GPCs and, therefore, each ROP unit 3702 can, in at least one embodiment, be coupled to each of GPCs. In at least one embodiment, ROP unit 3702 tracks packets received from different GPCs and determines which that a result generated by ROP unit 3702 is routed to through XBar 3520.

FIG. 38 illustrates a streaming multi-processor (“SM”) 3800, according to at least one embodiment. In at least one embodiment, SM 3800 is SM of FIG. 36 . In at least one embodiment, SM 3800 includes, without limitation, an instruction cache 3802; one or more scheduler units 3804; a register file 3808; one or more processing cores (“cores”) 3810; one or more special function units (“SFUs”) 3812; one or more load/store units (“LSUs”) 3814; an interconnect network 3816; a shared memory/level one (“L1”) cache 3818; and any suitable combination thereof. In at least one embodiment, a work distribution unit dispatches tasks for execution on general processing clusters (“GPCs”) of parallel processing units (“PPUs”) and each task is allocated to a particular Data Processing Cluster (“DPC”) within a GPC and, if task is associated with a shader program, task is allocated to one of SMs 3800. In at least one embodiment, scheduler unit 3804 receives tasks from work distribution unit and manages instruction scheduling for one or more thread blocks assigned to SM 3800. In at least one embodiment, scheduler unit 3804 schedules thread blocks for execution as warps of parallel threads, wherein each thread block is allocated at least one warp. In at least one embodiment, each warp executes threads. In at least one embodiment, scheduler unit 3804 manages a plurality of different thread blocks, allocating warps to different thread blocks and then dispatching instructions from plurality of different cooperative groups to various functional units (e.g., processing cores 3810, SFUs 3812, and LSUs 3814) during each clock cycle.

In at least one embodiment, Cooperative Groups may refer to a programming model for organizing groups of communicating threads that allows developers to express granularity at which threads are communicating, enabling expression of richer, more efficient parallel decompositions. In at least one embodiment, cooperative launch APIs support synchronization amongst thread blocks for execution of parallel algorithms. In at least one embodiment, applications of conventional programming models provide a single, simple construct for synchronizing cooperating threads: a barrier across all threads of a thread block (e.g., syncthreads( ) function). However, in at least one embodiment, programmers may define groups of threads at smaller than thread block granularities and synchronize within defined groups to enable greater performance, design flexibility, and software reuse in form of collective group-wide function interfaces. In at least one embodiment, Cooperative Groups enables programmers to define groups of threads explicitly at sub-block (i.e., as small as a single thread) and multi-block granularities, and to perform collective operations such as synchronization on threads in a cooperative group. In at least one embodiment, programming model supports clean composition across software boundaries, so that libraries and utility functions can synchronize safely within their local context without having to make assumptions about convergence. In at least one embodiment, Cooperative Groups primitives enable new patterns of cooperative parallelism, including, without limitation, producer-consumer parallelism, opportunistic parallelism, and global synchronization across an entire grid of thread blocks.

In at least one embodiment, a dispatch unit 3806 is configured to transmit instructions to one or more of functional units and scheduler unit 3804 includes, without limitation, two dispatch units 3806 that enable two different instructions from same warp to be dispatched during each clock cycle. In at least one embodiment, each scheduler unit 3804 includes a single dispatch unit 3806 or additional dispatch units 3806.

In at least one embodiment, each SM 3800, in at least one embodiment, includes, without limitation, register file 3808 that provides a set of registers for functional units of SM 3800. In at least one embodiment, register file 3808 is divided between each of functional units such that each functional unit is allocated a dedicated portion of register file 3808. In at least one embodiment, register file 3808 is divided between different warps being executed by SM 3800 and register file 3808 provides temporary storage for operands connected to data paths of functional units. In at least one embodiment, each SM 3800 comprises, without limitation, a plurality of L processing cores 3810. In at least one embodiment, SM 3800 includes, without limitation, a large number (e.g., 128 or more) of distinct processing cores 3810. In at least one embodiment, each processing core 3810, in at least one embodiment, includes, without limitation, a fully-pipelined, single-precision, double-precision, and/or mixed precision processing unit that includes, without limitation, a floating point arithmetic logic unit and an integer arithmetic logic unit. In at least one embodiment, floating point arithmetic logic units implement IEEE 754-2008 standard for floating point arithmetic. In at least one embodiment, processing cores 3810 include, without limitation, 64 single-precision (32-bit) floating point cores, 64 integer cores, 32 double-precision (64-bit) floating point cores, and 8 tensor cores.

Tensor cores are configured to perform matrix operations in accordance with at least one embodiment. In at least one embodiment, one or more tensor cores are included in processing cores 3810. In at least one embodiment, tensor cores are configured to perform deep learning matrix arithmetic, such as convolution operations for neural network training and inferencing. In at least one embodiment, each tensor core operates on a 4×4 matrix and performs a matrix multiply and accumulate operation D=A×B+C, where A, B, C, and D are 4×4 matrices.

In at least one embodiment, matrix multiply inputs A and B are 16-bit floating point matrices and accumulation matrices C and D are 16-bit floating point or 32-bit floating point matrices. In at least one embodiment, tensor cores operate on 16-bit floating point input data with 32-bit floating point accumulation. In at least one embodiment, 16-bit floating point multiply uses 64 operations and results in a full precision product that is then accumulated using 32-bit floating point addition with other intermediate products for a 4×4×4 matrix multiply. Tensor cores are used to perform much larger two-dimensional or higher dimensional matrix operations, built up from these smaller elements, in at least one embodiment. In at least one embodiment, an API, such as CUDA 9 C++ API, exposes specialized matrix load, matrix multiply and accumulate, and matrix store operations to efficiently use tensor cores from a CUDA-C++ program. In at least one embodiment, at CUDA level, warp-level interface assumes 16×16 size matrices spanning all 32 threads of warp.

In at least one embodiment, each SM 3800 comprises, without limitation, M SFUs 3812 that perform special functions (e.g., attribute evaluation, reciprocal square root, and like). In at least one embodiment, SFUs 3812 include, without limitation, a tree traversal unit configured to traverse a hierarchical tree data structure. In at least one embodiment, SFUs 3812 include, without limitation, a texture unit configured to perform texture map filtering operations. In at least one embodiment, texture units are configured to load texture maps (e.g., a 2D array of texels) from memory and sample texture maps to produce sampled texture values for use in shader programs executed by SM 3800. In at least one embodiment, texture maps are stored in shared memory/L1 cache 3818. In at least one embodiment, texture units implement texture operations such as filtering operations using mip-maps (e.g., texture maps of varying levels of detail), in accordance with at least one embodiment. In at least one embodiment, each SM 3800 includes, without limitation, two texture units.

Each SM 3800 comprises, without limitation, N LSUs 3814 that implement load and store operations between shared memory/L1 cache 3818 and register file 3808, in at least one embodiment. Each SM 3800 includes, without limitation, interconnect network 3816 that connects each of functional units to register file 3808 and LSU 3814 to register file 3808 and shared memory/L1 cache 3818 in at least one embodiment. In at least one embodiment, interconnect network 3816 is a crossbar that can be configured to connect any of functional units to any of registers in register file 3808 and connect LSUs 3814 to register file 3808 and memory locations in shared memory/L1 cache 3818.

In at least one embodiment, shared memory/L1 cache 3818 is an array of on-chip memory that allows for data storage and communication between SM 3800 and primitive engine and between threads in SM 3800, in at least one embodiment. In at least one embodiment, shared memory/L1 cache 3818 comprises, without limitation, 128 KB of storage capacity and is in path from SM 3800 to partition unit. In at least one embodiment, shared memory/L1 cache 3818, in at least one embodiment, is used to cache reads and writes. In at least one embodiment, one or more of shared memory/L1 cache 3818, L2 cache, and memory are backing stores.

Combining data cache and shared memory functionality into a single memory block provides improved performance for both types of memory accesses, in at least one embodiment. In at least one embodiment, capacity is used or is usable as a cache by programs that do not use shared memory, such as if shared memory is configured to use half of capacity, texture and load/store operations can use remaining capacity. Integration within shared memory/L1 cache 3818 enables shared memory/L1 cache 3818 to function as a high-throughput conduit for streaming data while simultaneously providing high-bandwidth and low-latency access to frequently reused data, in accordance with at least one embodiment. In at least one embodiment, when configured for general purpose parallel computation, a simpler configuration can be used compared with graphics processing. In at least one embodiment, fixed function graphics processing units are bypassed, creating a much simpler programming model. In general purpose parallel computation configuration, work distribution unit assigns and distributes blocks of threads directly to DPCs, in at least one embodiment. In at least one embodiment, threads in a block execute same program, using a unique thread ID in calculation to ensure each thread generates unique results, using SM 3800 to execute program and perform calculations, shared memory/L1 cache 3818 to communicate between threads, and LSU 3814 to read and write global memory through shared memory/L1 cache 3818 and memory partition unit. In at least one embodiment, when configured for general purpose parallel computation, SM 3800 writes commands that scheduler unit 3804 can use to launch new work on DPCs.

In at least one embodiment, PPU is included in or coupled to a desktop computer, a laptop computer, a tablet computer, servers, supercomputers, a smart-phone (e.g., a wireless, hand-held device), personal digital assistant (“PDA”), a digital camera, a vehicle, a head mounted display, a hand-held electronic device, and more. In at least one embodiment, PPU is embodied on a single semiconductor substrate. In at least one embodiment, PPU is included in a system-on-a-chip (“SoC”) along with one or more other devices such as additional PPUs, memory, a reduced instruction set computer (“RISC”) CPU, a memory management unit (“MMU”), a digital-to-analog converter (“DAC”), and like.

In at least one embodiment, PPU may be included on a graphics card that includes one or more memory devices. In at least one embodiment, graphics card may be configured to interface with a PCIe slot on a motherboard of a desktop computer. In at least one embodiment, PPU may be an integrated graphics processing unit (“iGPU”) included in chipset of motherboard.

In at least one embodiment, at least one component shown or described with respect to FIG. 38 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of FIG. 38 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of FIG. 38 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

In at least one embodiment, a single semiconductor platform may refer to a sole unitary semiconductor-based integrated circuit or chip. In at least one embodiment, multi-chip modules may be used with increased connectivity which simulate on-chip operation, and make substantial improvements over utilizing a conventional central processing unit (“CPU”) and bus implementation. In at least one embodiment, various modules may also be situated separately or in various combinations of semiconductor platforms per desires of user.

In at least one embodiment, computer programs in form of machine-readable executable code or computer control logic algorithms are stored in main memory 1804 and/or secondary storage. Computer programs, if executed by one or more processors, enable system 1800 to perform various functions in accordance with at least one embodiment. In at least one embodiment, memory 1804, storage, and/or any other storage are possible examples of computer-readable media. In at least one embodiment, secondary storage may refer to any suitable storage device or system such as a hard disk drive and/or a removable storage drive, representing a floppy disk drive, a magnetic tape drive, a compact disk drive, digital versatile disk (“DVD”) drive, recording device, universal serial bus (“USB”) flash memory, etc. In at least one embodiment, architecture and/or functionality of various previous figures are implemented in context of CPU 1802; parallel processing system 1812; an integrated circuit capable of at least a portion of capabilities of both CPU 1802; parallel processing system 1812; a chipset (e.g., a group of integrated circuits designed to work and sold as a unit for performing related functions, etc.); and any suitable combination of integrated circuit(s).

In at least one embodiment, architecture and/or functionality of various previous figures are implemented in context of a general computer system, a circuit board system, a game console system dedicated for entertainment purposes, an application-specific system, and more. In at least one embodiment, computer system 1800 may take form of a desktop computer, a laptop computer, a tablet computer, servers, supercomputers, a smart-phone (e.g., a wireless, hand-held device), personal digital assistant (“PDA”), a digital camera, a vehicle, a head mounted display, a hand-held electronic device, a mobile phone device, a television, workstation, game consoles, embedded system, and/or any other type of logic.

In at least one embodiment, parallel processing system 1812 includes, without limitation, a plurality of parallel processing units (“PPUs”) 1814 and associated memories 1816. In at least one embodiment, PPUs 1814 are connected to a host processor or other peripheral devices via an interconnect 1818 and a switch 1820 or multiplexer. In at least one embodiment, parallel processing system 1812 distributes computational tasks across PPUs 1814 which can be parallelizable for example, as part of distribution of computational tasks across multiple graphics processing unit (“GPU”) thread blocks. In at least one embodiment, memory is shared and accessible (e.g., for read and/or write access) across some or all of PPUs 1814, although such shared memory may incur performance penalties relative to use of local memory and registers resident to a PPU 1814. In at least one embodiment, operation of PPUs 1814 is synchronized through use of a command such as _syncthreads( ), wherein all threads in a block (e.g., executed across multiple PPUs 1814) to reach a certain point of execution of code before proceeding.

Networks

FIG. 39 illustrates a network 3900 for communicating data within a 5G wireless communications network, in accordance with at least one embodiment. In at least one embodiment, network 3900 comprises a base station 3906 having a coverage area 3904, a plurality of mobile devices 3908, and a backhaul network 3902. In at least one embodiment, as shown, base station 3906 establishes uplink and/or downlink connections with mobile devices 3908, which serve to carry data from mobile devices 3908 to base station 3906 and vice-versa. In at least one embodiment, data carried over uplink/downlink connections may include data communicated between mobile devices 3908, as well as data communicated to/from a remote-end (not shown) by way of backhaul network 3902. In at least one embodiment, term “base station” refers to any component (or collection of components) configured to provide wireless access to a network, such as an enhanced base station (eNB), a macro-cell, a femtocell, a Wi-Fi access point (AP), or other wirelessly enabled devices. In at least one embodiment, base stations may provide wireless access in accordance with one or more wireless communication protocols, e.g., long term evolution (LTE), LTE advanced (LTE-A), High Speed Packet Access (HSPA), Wi-Fi 802.11a/b/g/n/ac, etc. In at least one embodiment, term “mobile device” refers to any component (or collection of components) capable of establishing a wireless connection with a base station, such as a user equipment (UE), a mobile station (STA), and other wirelessly enabled devices. In some embodiments, network 3900 may comprise various other wireless devices, such as relays, low power nodes, etc.

In at least one embodiment, at least one component shown or described with respect to FIG. 39 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one base station 3906 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one base station 3906 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 40 illustrates a network architecture 4000 for a 5G wireless network, in accordance with at least one embodiment. In at least one embodiment, as shown, network architecture 4000 includes a radio access network (RAN) 4004, an evolved packet core (EPC) 4002, which may be referred to as a core network, and a home network 4016 of a UE 4008 attempting to access RAN 4004. In at least one embodiment, RAN 4004 and EPC 4002 form a serving wireless network. In at least one embodiment, RAN 4004 includes a base station 4006, and EPC 4002 includes a mobility management entity (MME) 4012, a serving gateway (SGW) 4010, and a packet data network (PDN) gateway (PGW) 4014. In at least one embodiment, home network 4016 includes an application server 4018 and a home subscriber server (HSS) 4020. In at least one embodiment, HSS 4020 may be part of home network 4016, EPC 4002, and/or variations thereof.

In at least one embodiment, MME 4012 is a termination point in a network for ciphering/integrity protection for NAS signaling and handles security key management. In at least one embodiment, it should be appreciated that term “MME” is used in 4G LTE networks, and that 5G LTE networks may include a Security Anchor Node (SEAN) or a Security Access Function (SEAF) that performs similar functions. In at least one embodiment, terms “MME,” “SEAN,” and “SEAF” may be used interchangeably. In at least one embodiment, MME 4012 also provides control plane function for mobility between LTE and 2G/3G access networks, as well as an interface to home networks of roaming UEs. In at least one embodiment, SGW 4010 routes and forwards user data packets, while also acting as a mobility anchor for an user plane during handovers. In at least one embodiment, PGW 4014 provides connectivity from UEs to external packet data networks by being a point of exit and entry of traffic for UEs. In at least one embodiment, HSS 4020 is a central database that contains user-related and subscription-related information. In at least one embodiment, application server 4018 is a central database that contains user-related information regarding various applications that may utilize and communicate via network architecture 4000.

In at least one embodiment, at least one component shown or described with respect to FIG. 40 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one base station 4006 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one base station 4006 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 41 is a diagram illustrating some basic functionality of a mobile telecommunications network/system operating in accordance with LTE and 5G principles, in accordance with at least one embodiment. In at least one embodiment, a mobile telecommunications system includes infrastructure equipment comprising base stations 4114 which are connected to a core network 4102, which operates in accordance with a conventional arrangement which will be understood by those acquainted with communications technology. In at least one embodiment, infrastructure equipment 4114 may also be referred to as a base station, network element, enhanced NodeB (eNodeB) or a coordinating entity for example, and provides a wireless access interface to one or more communications devices within a coverage area or cell represented by a broken line 4104, which may be referred to as a radio access network. In at least one embodiment, one or more mobile communications devices 4106 may communicate data via transmission and reception of signals representing data using a wireless access interface. In at least one embodiment, core network 4102 may also provide functionality including authentication, mobility management, charging and so on for communications devices served by a network entity.

In at least one embodiment, mobile communications devices of FIG. 41 may also be referred to as communications terminals, user equipment (UE), terminal devices and so forth, and are configured to communicate with one or more other communications devices served by a same or a different coverage area via a network entity. In at least one embodiment, these communications may be performed by transmitting and receiving signals representing data using a wireless access interface over two way communications links.

In at least one embodiment, as shown in FIG. 41 , one of eNodeBs 4114 a is shown in more detail to include a transmitter 4112 for transmitting signals via a wireless access interface to one or more communications devices or UEs 4106, and a receiver 4110 to receive signals from one or more UEs within coverage area 4104. In at least one embodiment, controller 4108 controls transmitter 4112 and receiver 4110 to transmit and receive signals via a wireless access interface. In at least one embodiment, controller 4108 may perform a function of controlling allocation of communications resource elements of a wireless access interface and may in some examples include a scheduler for scheduling transmissions via a wireless access interface for both uplink and downlink.

In at least one embodiment, an example UE 4106 a is shown in more detail to include a transmitter 4120 for transmitting signals on an uplink of a wireless access interface to eNodeB 4114 and a receiver 4118 for receiving signals transmitted by eNodeB 4114 on a downlink via a wireless access interface. In at least one embodiment, transmitter 4120 and receiver 4118 are controlled by a controller 4116.

In at least one embodiment, at least one component shown or described with respect to FIG. 41 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one base station 4114 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one base station 4114 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 42 illustrates a radio access network 4200, which may be part of a 5G network architecture, in accordance with at least one embodiment. In at least one embodiment, radio access network 4200 covers a geographic region divided into a number of cellular regions (cells) that can be uniquely identified by a user equipment (UE) based on an identification broadcasted over a geographical area from one access point or base station. In at least one embodiment, macrocells 4240, 4228, and 4216, and a small cell 4230, may include one or more sectors. In at least one embodiment, a sector is a sub-area of a cell and all sectors within one cell are served by a same base station. In at least one embodiment, a single logical identification belonging to that sector can identify a radio link within a sector. In at least one embodiment, multiple sectors within a cell can be formed by groups of antennas with each antenna responsible for communication with UEs in a portion of a cell.

In at least one embodiment, each cell is served by a base station (BS). In at least one embodiment, a base station is a network element in a radio access network responsible for radio transmission and reception in one or more cells to or from a UE. In at least one embodiment, a base station may also be referred to as a base transceiver station (BTS), a radio base station, a radio transceiver, a transceiver function, a basic service set (BSS), an extended service set (ESS), an access point (AP), a Node B (NB), an eNode B (eNB), a gNode B (gNB), or some other suitable terminology. In at least one embodiment, base stations may include a backhaul interface for communication with a backhaul portion of a network. In at least one embodiment, a base station has an integrated antenna or is connected to an antenna or remote radio head (RRH) by feeder cables.

In at least one embodiment, a backhaul may provide a link between a base station and a core network, and in some examples, a backhaul may provide interconnection between respective base stations. In at least one embodiment, a core network is a part of a wireless communication system that is generally independent of radio access technology used in a radio access network. In at least one embodiment, various types of backhaul interfaces, such as a direct physical connection, a virtual network, or like using any suitable transport network, may be employed. In at least one embodiment, some base stations may be configured as integrated access and backhaul (IAB) nodes, where a wireless spectrum may be used both for access links (i.e., wireless links with UEs), and for backhaul links, which is sometimes referred to as wireless self-backhauling. In at least one embodiment, through wireless self-backhauling, a wireless spectrum utilized for communication between a base station and UE may be leveraged for backhaul communication, enabling fast and easy deployment of highly dense small cell networks, as opposed to requiring each new base station deployment to be outfitted with its own hard-wired backhaul connection.

In at least one embodiment, high-power base stations 4236 and 4220 are shown in cells 4240 and 4228, and a high-power base station 4210 is shown controlling a remote radio head (RRH) 4212 in cell 4216. In at least one embodiment, cells 4240, 4228, and 4216 may be referred to as large size cells or macrocells. In at least one embodiment, a low-power base station 4234 is shown in small cell 4230 (e.g., a microcell, picocell, femtocell, home base station, home Node B, home eNode B, etc.) which may overlap with one or more macrocells, and may be referred to as a small cell or small size cell. In at least one embodiment, cell sizing can be done according to system design as well as component constraints. In at least one embodiment, a relay node may be deployed to extend size or coverage area of a given cell. In at least one embodiment, radio access network 4200 may include any number of wireless base stations and cells. In at least one embodiment, base stations 4236, 4220, 4210, 4234 provide wireless access points to a core network for any number of mobile apparatuses.

In at least one embodiment, a quadcopter or drone 4242 may be configured to function as a base station. In at least one embodiment, a cell may not necessarily be stationary, and a geographic area of a cell may move according to a location of a mobile base station such as quadcopter 4242.

In at least one embodiment, radio access network 4200 supports wireless communications for multiple mobile apparatuses. In at least one embodiment, a mobile apparatus is commonly referred to as user equipment (UE), but may also be referred to as a mobile station (MS), a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless device, a wireless communications device, a remote device, a mobile subscriber station, an access terminal (AT), a mobile terminal, a wireless terminal, a remote terminal, a handset, a terminal, a user agent, a mobile client, a client, or some other suitable terminology. In at least one embodiment, a UE may be an apparatus that provides a user with access to network services.

In at least one embodiment, a “mobile” apparatus need not necessarily have a capability to move, and may be stationary. In at least one embodiment, mobile apparatus or mobile device broadly refers to a diverse array of devices and technologies. In at least one embodiment, a mobile apparatus may be a mobile, a cellular (cell) phone, a smart phone, a session initiation protocol (SIP) phone, a laptop, a personal computer (PC), a notebook, a netbook, a smartbook, a tablet, a personal digital assistant (PDA), a broad array of embedded systems, e.g., corresponding to an “Internet of things” (IoT), an automotive or other transportation vehicle, a remote sensor or actuator, a robot or robotics device, a satellite radio, a global positioning system (GPS) device, an object tracking device, a drone, a multi-copter, a quad-copter, a remote control device, a consumer and/or wearable device, such as eyewear, a wearable camera, a virtual reality device, a smart watch, a health or fitness tracker, a digital audio player (e.g., MP3 player), a camera, a game console, a digital home or smart home device such as a home audio, video, and/or multimedia device, an appliance, a vending machine, intelligent lighting, a home security system, a smart meter, a security device, a solar panel or solar array, a municipal infrastructure device controlling electric power (e.g., a smart grid), lighting, water, etc., an industrial automation and enterprise device, a logistics controller, agricultural equipment, military defense equipment, vehicles, aircraft, ships, and weaponry, etc. In at least one embodiment, a mobile apparatus may provide for connected medicine or telemedicine support, i.e., health care at a distance. In at least one embodiment, telehealth devices may include telehealth monitoring devices and telehealth administration devices, whose communication may be given preferential treatment or prioritized access over other types of information, e.g., in terms of prioritized access for transport of critical service data, and/or relevant QoS for transport of critical service data.

In at least one embodiment, cells of radio access network 4200 may include UEs that may be in communication with one or more sectors of each cell. In at least one embodiment, UEs 4214 and 4208 may be in communication with base station 4210 by way of RRH 4212; UEs 4222 and 4226 may be in communication with base station 4220; UE 4232 may be in communication with low-power base station 4234; UEs 4238 and 4218 may be in communication with base station 4236; and UE 4244 may be in communication with mobile base station 4242. In at least one embodiment, each base station 4210, 4220, 4234, 4236, and 4242 may be configured to provide an access point to a core network (not shown) for all UEs in respective cells and transmissions from a base station (e.g., base station 4236) to one or more UEs (e.g., UEs 4238 and 4218) may be referred to as downlink (DL) transmission, while transmissions from a UE (e.g., UE 4238) to a base station may be referred to as uplink (UL) transmissions. In at least one embodiment, downlink may refer to a point-to-multipoint transmission, which may be referred to as broadcast channel multiplexing. In at least one embodiment, uplink may refer to a point-to-point transmission.

In at least one embodiment, quadcopter 4242, which may be referred to as a mobile network node, may be configured to function as a UE within cell 4240 by communicating with base station 4236. In at least one embodiment, multiple UEs (e.g., UEs 4222 and 4226) may communicate with each other using peer to peer (P2P) or sidelink signals 4224, which may bypass a base station such as base station 4220.

In at least one embodiment, ability for a UE to communicate while moving, independent of its location, is referred to as mobility. In at least one embodiment, a mobility management entity (MME) sets up, maintains, and releases various physical channels between a UE and a radio access network. In at least one embodiment, DL-based mobility or UL-based mobility may be utilized by a radio access network 4200 to enable mobility and handovers (i.e., transfer of a UE's connection from one radio channel to another). In at least one embodiment, a UE, in a network configured for DL-based mobility, may monitor various parameters of a signal from its serving cell as well as various parameters of neighboring cells, and, depending on a quality of these parameters, a UE may maintain communication with one or more neighboring cells. In at least one embodiment, if signal quality from a neighboring cell exceeds that from a serving cell for a given amount of time, or if a UE moves from one cell to another, a UE may undertake a handoff or handover from a serving cell to a neighboring (target) cell. In at least one embodiment, UE 4218 (illustrated as a vehicle, although any suitable form of UE may be used) may move from a geographic area corresponding to a cell, such as serving cell 4240, to a geographic area corresponding to a neighbor cell, such as neighbor cell 4216. In at least one embodiment, UE 4218 may transmit a reporting message to its serving base station 4236 indicating its condition when signal strength or quality from a neighbor cell 4216 exceeds that of its serving cell 4240 for a given amount of time. In at least one embodiment, UE 4218 may receive a handover command, and may undergo a handover to cell 4216.

In at least one embodiment, UL reference signals from each UE may be utilized by a network configured for UL-based mobility to select a serving cell for each UE. In at least one embodiment, base stations 4236, 4220, and 4210/4212 may broadcast unified synchronization signals (e.g., unified Primary Synchronization Signals (PSSs), unified Secondary Synchronization Signals (SSSs) and unified Physical Broadcast Channels (PBCH)). In at least one embodiment, UEs 4238, 4218, 4222, 4226, 4214, and 4208 may receive unified synchronization signals, derive a carrier frequency and slot timing from synchronization signals, and in response to deriving timing, transmit an uplink pilot or reference signal. In at least one embodiment, two or more cells (e.g., base stations 4236 and 4210/4212) within radio access network 4200 may concurrently receive an uplink pilot signal transmitted by a UE (e.g., UE 4218). In at least one embodiment, cells may measure a strength of a pilot signal, and a radio access network (e.g., one or more of base stations 4236 and 4210/4212 and/or a central node within a core network) may determine a serving cell for UE 4218. In at least one embodiment, a network may continue to monitor an uplink pilot signal transmitted by UE 4218 as UE 4218 moves through radio access network 4200. In at least one embodiment, a network 4200 may handover UE 4218 from a serving cell to a neighboring cell, with or without informing UE 4218, when a signal strength or quality of a pilot signal measured by a neighboring cell exceeds that of a signal strength or quality measured by a serving cell.

In at least one embodiment, synchronization signals transmitted by base stations 4236, 4220, and 4210/4212 may be unified, but may not identify a particular cell and rather may identify a zone of multiple cells operating on a same frequency and/or with a same timing. In at least one embodiment, zones in 5G networks or other next generation communication networks enable uplink-based mobility framework and improves efficiency of both a UE and a network, since amounts of mobility messages that need to be exchanged between a UE and a network may be reduced.

In at least one embodiment, air interface in a radio access network 4200 may utilize unlicensed spectrum, licensed spectrum, or shared spectrum. In at least one embodiment, unlicensed spectrum provides for shared use of a portion of a spectrum without need for a government-granted license, however, while compliance with some technical rules is generally still required to access an unlicensed spectrum, generally, any operator or device may gain access. In at least one embodiment, licensed spectrum provides for exclusive use of a portion of a spectrum, generally by virtue of a mobile network operator purchasing a license from a government regulatory body. In at least one embodiment, shared spectrum may fall between licensed and unlicensed spectrum, wherein technical rules or limitations may be required to access a spectrum, but a spectrum may still be shared by multiple operators and/or multiple RATs. In at least one embodiment, for example, a holder of a license for a portion of licensed spectrum may provide licensed shared access (LSA) to share that spectrum with other parties, e.g., with suitable licensee-determined conditions to gain access.

In at least one embodiment, at least one component shown or described with respect to FIG. 42 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one of base station of radio access network 4200, such as a gNB, is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one base station of radio access network 4200, such as a gNB, is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 43 provides an example illustration of a 5G mobile communications system in which a plurality of different types of devices is used, in accordance with at least one embodiment. In at least one embodiment, as shown in FIG. 43 , a first base station 4318 may be provided to a large cell or macro cell in which transmission of signals is over several kilometers. In at least one embodiment, however, system may also support transmission via a very small cell such as transmitted by a second infrastructure equipment 4316 which transmits and receives signals over a distance of hundreds of meters thereby forming a so called “Pico” cell. In at least one embodiment, a third type of infrastructure equipment 4312 may transmit and receive signals over a distance of tens of meters and therefore can be used to form a so called “Femto” cell.

In at least one embodiment, also shown in FIG. 43 , different types of communications devices may be used to transmit and receive signals via different types of infrastructure equipment 4312, 4316, 4318 and communication of data may be adapted in accordance with different types of infrastructure equipment using different communications parameters. In at least one embodiment, conventionally, a mobile communications device may be configured to communicate data to and from a mobile communications network via available communication resources of network. In at least one embodiment, a wireless access system is configured to provide highest data rates to devices such as smart phones 4306. In at least one embodiment, “internet of things” may be provided in which low power machine type communications devices transmit and receive data at very low power, low bandwidth and may have a low complexity. In at least one embodiment, an example of such a machine type communication device 4314 may communicate via a Pico cell 4316. In at least one embodiment, a very high data rate and a low mobility may be characteristic of communications with, for example, a television 4304 which may be communicating via a Pico cell. In at least one embodiment, a very high data rate and low latency may be required by a virtual reality headset 4308. In at least one embodiment, a relay device 4310 may be deployed to extend size or coverage area of a given cell or network.

In at least one embodiment, at least one component shown or described with respect to FIG. 43 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one base station, such as base station 4318 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one base station, such as base station 4318 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 44 illustrates an example high level system 4400, in which at least one embodiment may be used. In at least one embodiment, high level system 4400 includes applications 4402, system software+libraries 4404, framework software 4406 and a datacenter infrastructure+resource orchestrator 4408. In at least one embodiment, high level system 4400 may be implemented as a cloud service, physical service, virtual service, network service, and/or variations thereof.

In at least one embodiment, as shown in FIG. 44 , datacenter infrastructure+resource orchestrator 4408 may include 5G radio resource orchestrator 4410, GPU packet processing & I/O 4412, and node computing resources (“node C.R.s”) 4416(1)-4416(N), where “N” represents any whole, positive integer. In at least one embodiment, node C.R.s 4416(1)-4416(N) may include, but are not limited to, any number of central processing units (“CPUs”) or other processors (including accelerators, field programmable gate arrays (FPGAs), graphics processors (“GPUs”), etc.), memory devices (e.g., dynamic read-only memory), storage devices (e.g., solid state or disk drives), network input/output (“NW I/O”) devices, network switches, virtual machines (“VMs”), power modules, and cooling modules, etc. In at least one embodiment, one or more node C.R.s from among node C.R.s 4416(1)-4416(N) may be a server having one or more of above-mentioned computing resources.

In at least one embodiment, 5G radio resource orchestrator 4410 may configure or otherwise control one or more node C.R.s 4416(1)-4416(N) and/or other various components and resources a 5G network architecture may comprise. In at least one embodiment, 5G radio resource orchestrator 4410 may include a software design infrastructure (“SDI”) management entity for high level system 4400. In at least one embodiment, 5G radio resource orchestrator 4410 may include hardware, software or some combination thereof. In at least one embodiment, 5G radio resource orchestrator 4410 may be utilized to configure or otherwise control various medium access control sublayers, radio access networks, physical layers or sublayers, and/or variations thereof, which may be part of a 5G network architecture. In at least one embodiment, 5G radio resource orchestrator 4410 may configure or allocate grouped compute, network, memory or storage resources to support one or more workloads which may be executed as part of a 5G network architecture.

In at least one embodiment, GPU packet processing & I/O 4412 may configure or otherwise process various inputs and outputs, as well as packets such as data packets, which may be transmitted/received as part of a 5G network architecture, which may be implemented by high level system 4400. In at least one embodiment, a packet may be data formatted to be provided by a network and may be typically divided into control information and payload (i.e., user data). In at least one embodiment, types of packets may include Internet Protocol version 4 (IPv4) packets, Internet Protocol version 6 (IPv6) packets, and Ethernet II frame packets. In at least one embodiment, control data of a data packet may be classified into data integrity fields and semantic fields. In at least one embodiment, network connections that a data packet may be received upon include a local area network, a wide-area network, a virtual private network, Internet, an intranet, an extranet, a public switched telephone network, an infrared network, a wireless network, a satellite network and any combination thereof.

In at least one embodiment, framework software 4406 includes an AI Model Architecture+Training+Use Cases 4422. In at least one embodiment, AI Model Architecture+Training+Use Cases 4422 may include tools, services, software or other resources to train one or more machine learning models or predict or infer information using one or more machine learning models according to one or more embodiments. For example, in at least one embodiment, a machine learning model may be trained by calculating weight parameters according to a neural network architecture using software and computing resources described above with respect to high level system 4400. In at least one embodiment, trained machine learning models corresponding to one or more neural networks may be used to infer or predict information using resources described above with respect to high level system 4400 by using weight parameters calculated through one or more training techniques. In at least one embodiment, framework software 4406 may include a framework to support system software+libraries 4404 and applications 4402.

In at least one embodiment, system software+libraries 4404 or applications 4402 may respectively include web-based service software or applications, such as those provided by Amazon Web Services, Google Cloud and Microsoft Azure. In at least one embodiment, framework software 4406 may include, but is not limited to, a type of free and open-source software web application framework such as Apache Spark™ (hereinafter “Spark”). In at least one embodiment, system software+libraries 4404 may include software used by at least portions of node C.R.s 4416(1)-4416(N). In at least one embodiment, one or more types of software may include, but are not limited to, Internet web page search software, e-mail virus scan software, database software, and streaming video content software.

In at least one embodiment, PHY 4418 is a set of system software and libraries configured to provide an interface with a physical layer of a wireless technology, which may be a physical layer such as a 5G New Radio (NR) physical layer. In at least one embodiment, an NR physical layer utilizes a flexible and scalable design and may comprise various components and technologies, such as modulation schemes, waveform structures, frame structures, reference signals, multi-antenna transmission and channel coding.

In at least one embodiment, a NR physical layer supports quadrature phase shift keying (QPSK), 16 quadrature amplitude modulation (QAM), 64 QAM and 256 QAM modulation formats. In at least one embodiment, different modulation schemes for different user entity (UE) categories may also be included in a NR physical layer. In at least one embodiment, a NR physical layer may utilize cyclic prefix orthogonal frequency division multiplexing (CP-OFDM) with a scalable numerology (subcarrier spacing, cyclic prefix) in both uplink (UL) and downlink (DL) up to at least 52.6 GHz. In at least one embodiment, a NR physical layer may support discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-SOFDM) in UL for coverage-limited scenarios, with single stream transmissions (that is, without spatial multiplexing).

In at least one embodiment, a NR frame supports time division duplex (TDD) and frequency division duplex (FDD) transmissions and operation in both licensed and unlicensed spectrum, which enables very low latency, fast hybrid automatic repeat request (HARQ) acknowledgements, dynamic TDD, coexistence with LTE and transmissions of variable length (for example, short duration for ultra-reliable low-latency communications (URLLC) and long duration for enhanced mobile broadband (eMBB)). In at least one embodiment, NR frame structure follows three key design principles to enhance forward compatibility and reduce interactions between different features.

In at least one embodiment, a first principle is that transmissions are self-contained, which can refer to a scheme in which data in a slot and in a beam are decodable on its own without dependency on other slots and beams. In at least one embodiment, this implies that reference signals required for demodulation of data are included in a given slot and a given beam. In at least one embodiment, a second principle is that transmissions are well confined in time and frequency, which results in a scheme in which new types of transmissions in parallel with legacy transmissions may be introduced. In at least one embodiment, a third principle is avoiding static and/or strict timing relations across slots and across different transmission directions. In at least one embodiment, usage of a third principle can entail utilizing asynchronous hybrid automatic repeat request (HARQ) instead of predefined retransmission time.

In at least one embodiment, NR frame structure also allows for rapid HARQ acknowledgement, in which decoding is performed during reception of DL data and HARQ acknowledgement is prepared by a UE during a guard period, when switching from DL reception to UL transmission. In at least one embodiment, to obtain low latency, a slot (or a set of slots in case of slot aggregation) is front-loaded with control signals and reference signals at a beginning of a slot (or set of slots).

In at least one embodiment, NR has an ultra-lean design that minimizes always-on transmissions to enhance network energy efficiency and ensure forward compatibility. In at least one embodiment, reference signals in NR are transmitted only when necessary. In at least one embodiment, four main reference signals are demodulation reference signal (DMRS), phase-tracking reference signal (PTRS), sounding reference signal (SRS) and channel-state information reference signal (CSI-RS).

In at least one embodiment, DMRS is used to estimate a radio channel for demodulation. In at least one embodiment, DMRS is UE-specific, can be beamformed, confined in a scheduled resource, and transmitted only when necessary, both in DL and UL. In at least one embodiment, to support multiple-layer multiple-input, multiple-output (MIMO) transmission, multiple orthogonal DMRS ports can be scheduled, one for each layer. In at least one embodiment, a basic DMRS pattern is front loaded, as a DMRS design takes into account an early decoding requirement to support low-latency applications. In at least one embodiment, for low-speed scenarios, DMRS uses low density in a time domain. In at least one embodiment, however, for high-speed scenarios, a time density of DMRS is increased to track fast changes in a radio channel.

In at least one embodiment, PTRS is introduced in NR to enable compensation of oscillator phase noise. In at least one embodiment, typically, phase noise increases as a function of oscillator carrier frequency. In at least one embodiment, PTRS can therefore be utilized at high carrier frequencies (such as mmWave) to mitigate phase noise. In at least one embodiment, PTRS is UE-specific, confined in a scheduled resource and can be beamformed. In at least one embodiment, PTRS is configurable depending on a quality of oscillators, carrier frequency, OFDM sub-carrier spacing, and modulation and coding schemes used for transmission.

In at least one embodiment, SRS is transmitted in UL to perform channel state information (CSI) measurements mainly for scheduling and link adaptation. In at least one embodiment, for NR, SRS is also utilized for reciprocity-based precoder design for massive MIMO and UL beam management. In at least one embodiment, SRS has a modular and flexible design to support different procedures and UE capabilities. In at least one embodiment, an approach for channel state information reference signal (CSI-RS) is similar.

In at least one embodiment, NR employs different antenna solutions and techniques depending on which part of a spectrum is used for its operation. In at least one embodiment, for lower frequencies, a low to moderate number of active antennas (up to around 32 transmitter chains) is assumed and FDD operation is common. In at least one embodiment, acquisition of CSI requires transmission of CSI-RS in a DL and CSI reporting in an UL. In at least one embodiment, limited bandwidths available in this frequency region require high spectral efficiency enabled by multi-user MIMO (MU-MIMO) and higher order spatial multiplexing, which is achieved via higher resolution CSI reporting compared with LTE.

In at least one embodiment, for higher frequencies, a larger number of antennas can be employed in a given aperture, which increases a capability for beamforming and multi user (MU)-MIMO. In at least one embodiment, here, spectrum allocations are of TDD type and reciprocity-based operation is assumed. In at least one embodiment, high-resolution CSI in a form of explicit channel estimations is acquired by UL channel sounding. In at least one embodiment, such high-resolution CSI enables sophisticated precoding algorithms to be employed at a base station (BS). In at least one embodiment, for even higher frequencies (in mmWave range) an analog beamforming implementation is typically required currently, which limits transmission to a single beam direction per time unit and radio chain. In at least one embodiment, since an isotropic antenna element is very small in this frequency region owing to a short carrier wavelength, a great number of antenna elements is required to maintain coverage. In at least one embodiment, beamforming needs to be applied at both transmitter and receiver ends to combat increased path loss, even for control channel transmission.

In at least one embodiment, to support these diverse use cases, NR features a highly flexible but unified CSI framework, in which there is reduced coupling between CSI measurement, CSI reporting and an actual DL transmission in NR compared with LTE. In at least one embodiment, NR also supports more advanced schemes such as multi-point transmission and coordination. In at least one embodiment, control and data transmissions follow a self-contained principle, where all information required to decode a transmission (such as accompanying DMRS) is contained within a transmission itself. In at least one embodiment, as a result, a network can seamlessly change a transmission point or beam as an UE moves in a network.

In at least one embodiment, MAC 4420 is a set of system software and libraries configured to provide an interface with a medium access control (MAC) layer, which may be part of a 5G network architecture. In at least one embodiment, a MAC layer controls hardware responsible for interaction with a wired, optical or wireless transmission medium. In at least one embodiment, MAC provides flow control and multiplexing for a transmission medium.

In at least one embodiment, a MAC sublayer provides an abstraction of a physical layer such that complexities of a physical link control are invisible to a logical link control (LLC) and upper layers of a network stack. In at least one embodiment, any LLC sublayer (and higher layers) may be used with any MAC. In at least one embodiment, any MAC can be used with any physical layer, independent of transmission medium. In at least one embodiment, a MAC sublayer, when sending data to another device on a network, encapsulates higher-level frames into frames appropriate for a transmission medium, adds a frame check sequence to identify transmission errors, and then forwards data to a physical layer as soon as appropriate channel access method permits it. In at least one embodiment, MAC is also responsible for compensating for collisions if a jam signal is detected, in which a MAC may initiate retransmission.

In at least one embodiment, applications 4402 may include one or more types of applications used by at least portions of node C.R.s 4416(1)-4416(N) and/or framework software 4406. In at least one embodiment, one or more types of applications may include, but are not limited to, any number of a genomics application, a cognitive compute, and a machine learning application, including training or inferencing software, machine learning framework software (e.g., PyTorch, TensorFlow, Caffe, etc.) or other machine learning applications used in conjunction with one or more embodiments.

In at least one embodiment, RAN APIs 4414 may be a set of subroutine definitions, communication protocols, and/or software tools that provide a method of communication with components of a radio access network (RAN) which may be part of a 5G network architecture. In at least one embodiment, a radio access network is part of a network communications system and may implement a radio access technology. In at least one embodiment, radio access network functionality is typically provided by a silicon chip residing in both a core network as well as user equipment. Further information regarding a radio access network can be found in the description of FIG. 42 .

In at least one embodiment, high level system 4400 may use CPUs, application-specific integrated circuits (ASICs), GPUs, FPGAs, or other hardware to perform training, inferencing, and/or other various processes using above-described resources. In at least one embodiment, moreover, one or more software and/or hardware resources described above may be configured as a service to allow users to train or performing inferencing of information, such as image recognition, speech recognition, or other artificial intelligence services, as well as other services such as services that allow users to configure and implement various aspects of a 5G network architecture.

In at least one embodiment, at least one component shown or described with respect to FIG. 44 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one of PHY 4418 and/or at least one node C.R. 4416 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one of PHY 4418 and/or at least one node C.R. 4416 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 45 illustrates an architecture of a system 4500 of a network, in accordance with at least one embodiment. In at least one embodiment, system 4500 is shown to include a user equipment (UE) 4502 and a UE 4504. In at least one embodiment, UEs 4502 and 4504 are illustrated as smartphones (e.g., handheld touchscreen mobile computing devices connectable to one or more cellular networks) but may also comprise any mobile or non-mobile computing device, such as Personal Data Assistants (PDAs), pagers, laptop computers, desktop computers, wireless handsets, or any computing device including a wireless communications interface.

In at least one embodiment, any of UEs 4502 and 4504 can comprise an Internet of Things (IoT) UE, which can comprise a network access layer designed for low-power IoT applications utilizing short-lived UE connections. In at least one embodiment, an IoT UE can utilize technologies such as machine-to-machine (M2M) or machine-type communications (MTC) for exchanging data with an MTC server or device via a public land mobile network (PLMN), Proximity-Based Service (ProSe) or device-to-device (D2D) communication, sensor networks, or IoT networks. In at least one embodiment, a M2M or MTC exchange of data may be a machine-initiated exchange of data. In at least one embodiment, an IoT network describes interconnecting IoT UEs, which may include uniquely identifiable embedded computing devices (within Internet infrastructure), with short-lived connections. In at least one embodiment, an IoT UEs may execute background applications (e.g., keep alive messages, status updates, etc.) to facilitate connections of an IoT network.

In at least one embodiment, UEs 4502 and 4504 may be configured to connect, e.g., communicatively couple, with a radio access network (RAN) 4516. In at least one embodiment, RAN 4516 may be, for example, an Evolved Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (E-UTRAN), a NextGen RAN (NG RAN), or some other type of RAN. In at least one embodiment, UEs 4502 and 4504 utilize connections 4512 and 4514, respectively, each of which comprises a physical communications interface or layer. In at least one embodiment, connections 4512 and 4514 are illustrated as an air interface to enable communicative coupling, and can be consistent with cellular communications protocols, such as a Global System for Mobile Communications (GSM) protocol, a code-division multiple access (CDMA) network protocol, a Push-to-Talk (PTT) protocol, a PTT over Cellular (POC) protocol, a Universal Mobile Telecommunications System (UMTS) protocol, a 3GPP Long Term Evolution (LTE) protocol, a fifth generation (5G) protocol, a New Radio (NR) protocol, and variations thereof.

In at least one embodiment, UEs 4502 and 4504 may further directly exchange communication data via a ProSe interface 4506. In at least one embodiment, ProSe interface 4506 may alternatively be referred to as a sidelink interface comprising one or more logical channels, including but not limited to a Physical Sidelink Control Channel (PSCCH), a Physical Sidelink Shared Channel (PSSCH), a Physical Sidelink Discovery Channel (PSDCH), and a Physical Sidelink Broadcast Channel (PSBCH).

In at least one embodiment, UE 4504 is shown to be configured to access an access point (AP) 4510 via connection 4508. In at least one embodiment, connection 4508 can comprise a local wireless connection, such as a connection consistent with any IEEE 802.11 protocol, wherein AP 4510 would comprise a wireless fidelity (WiFi®) router. In at least one embodiment, AP 4510 is shown to be connected to an Internet without connecting to a core network of a wireless system.

In at least one embodiment, RAN 4516 can include one or more access nodes that enable connections 4512 and 4514. In at least one embodiment, these access nodes (ANs) can be referred to as base stations (BSs), NodeBs, evolved NodeBs (eNBs), next Generation NodeBs (gNB), RAN nodes, and so forth, and can comprise ground stations (e.g., terrestrial access points) or satellite stations providing coverage within a geographic area (e.g., a cell). In at least one embodiment, RAN 4516 may include one or more RAN nodes for providing macrocells, e.g., macro RAN node 4518, and one or more RAN nodes for providing femtocells or picocells (e.g., cells having smaller coverage areas, smaller user capacity, or higher bandwidth compared to macrocells), e.g., low power (LP) RAN node 4520.

In at least one embodiment, any of RAN nodes 4518 and 4520 can terminate an air interface protocol and can be a first point of contact for UEs 4502 and 4504. In at least one embodiment, any of RAN nodes 4518 and 4520 can fulfill various logical functions for RAN 4516 including, but not limited to, radio network controller (RNC) functions such as radio bearer management, uplink and downlink dynamic radio resource management and data packet scheduling, and mobility management.

In at least one embodiment, UEs 4502 and 4504 can be configured to communicate using Orthogonal Frequency-Division Multiplexing (OFDM) communication signals with each other or with any of RAN nodes 4518 and 4520 over a multi-carrier communication channel in accordance various communication techniques, such as, but not limited to, an Orthogonal Frequency Division Multiple Access (OFDMA) communication technique (e.g., for downlink communications) or a Single Carrier Frequency Division Multiple Access (SC-FDMA) communication technique (e.g., for uplink and ProSe or sidelink communications), and/or variations thereof. In at least one embodiment, OFDM signals can comprise a plurality of orthogonal sub-carriers.

In at least one embodiment, a downlink resource grid can be used for downlink transmissions from any of RAN nodes 4518 and 4520 to UEs 4502 and 4504, while uplink transmissions can utilize similar techniques. In at least one embodiment, a grid can be a time frequency grid, called a resource grid or time-frequency resource grid, which is a physical resource in a downlink in each slot. In at least one embodiment, such a time frequency plane representation is a common practice for OFDM systems, which makes it intuitive for radio resource allocation. In at least one embodiment, each column and each row of a resource grid corresponds to one OFDM symbol and one OFDM subcarrier, respectively. In at least one embodiment, a duration of a resource grid in a time domain corresponds to one slot in a radio frame. In at least one embodiment, a smallest time-frequency unit in a resource grid is denoted as a resource element. In at least one embodiment, each resource grid comprises a number of resource blocks, which describe a mapping of certain physical channels to resource elements. In at least one embodiment, each resource block comprises a collection of resource elements. In at least one embodiment, in a frequency domain, this may represent a smallest quantity of resources that currently can be allocated. In at least one embodiment, there are several different physical downlink channels that are conveyed using such resource blocks.

In at least one embodiment, a physical downlink shared channel (PDSCH) may carry user data and higher-layer signaling to UEs 4502 and 4504. In at least one embodiment, a physical downlink control channel (PDCCH) may carry information about a transport format and resource allocations related to PDSCH channel, among other things. In at least one embodiment, it may also inform UEs 4502 and 4504 about a transport format, resource allocation, and HARQ (Hybrid Automatic Repeat Request) information related to an uplink shared channel. In at least one embodiment, typically, downlink scheduling (assigning control and shared channel resource blocks to UE 4502 within a cell) may be performed at any of RAN nodes 4518 and 4520 based on channel quality information fed back from any of UEs 4502 and 4504. In at least one embodiment, downlink resource assignment information may be sent on a PDCCH used for (e.g., assigned to) each of UEs 4502 and 4504.

In at least one embodiment, a PDCCH may use control channel elements (CCEs) to convey control information. In at least one embodiment, before being mapped to resource elements, PDCCH complex valued symbols may first be organized into quadruplets, which may then be permuted using a sub-block interleaver for rate matching. In at least one embodiment, each PDCCH may be transmitted using one or more of these CCEs, where each CCE may correspond to nine sets of four physical resource elements known as resource element groups (REGs). In at least one embodiment, four Quadrature Phase Shift Keying (QPSK) symbols may be mapped to each REG. In at least one embodiment, PDCCH can be transmitted using one or more CCEs, depending on a size of a downlink control information (DCI) and a channel condition. In at least one embodiment, there can be four or more different PDCCH formats defined in LTE with different numbers of CCEs (e.g., aggregation level, L=1, 2, 4, or 8).

In at least one embodiment, an enhanced physical downlink control channel (EPDCCH) that uses PDSCH resources may be utilized for control information transmission. In at least one embodiment, EPDCCH may be transmitted using one or more enhanced control channel elements (ECCEs). In at least one embodiment, each ECCE may correspond to nine sets of four physical resource elements known as an enhanced resource element groups (EREGs). In at least one embodiment, an ECCE may have other numbers of EREGs in some situations.

In at least one embodiment, RAN 4516 is shown to be communicatively coupled to a core network (CN) 4538 via an S1 interface 4522. In at least one embodiment, CN 4538 may be an evolved packet core (EPC) network, a NextGen Packet Core (NPC) network, or some other type of CN. In at least one embodiment, S1 interface 4522 is split into two parts: S1-U interface 4526, which carries traffic data between RAN nodes 4518 and 4520 and serving gateway (S-GW) 4530, and a S1-mobility management entity (MME) interface 4524, which is a signaling interface between RAN nodes 4518 and 4520 and MMEs 4528.

In at least one embodiment, CN 4538 comprises MMEs 4528, S-GW 4530, Packet Data Network (PDN) Gateway (P-GW) 4534, and a home subscriber server (HSS) 4532. In at least one embodiment, MMEs 4528 may be similar in function to a control plane of legacy Serving General Packet Radio Service (GPRS) Support Nodes (SGSN). In at least one embodiment, MMEs 4528 may manage mobility aspects in access such as gateway selection and tracking area list management. In at least one embodiment, HSS 4532 may comprise a database for network users, including subscription related information to support a network entities' handling of communication sessions. In at least one embodiment, CN 4538 may comprise one or several HSSs 4532, depending on a number of mobile subscribers, on a capacity of an equipment, on an organization of a network, etc. In at least one embodiment, HSS 4532 can provide support for routing/roaming, authentication, authorization, naming/addressing resolution, location dependencies, etc.

In at least one embodiment, S-GW 4530 may terminate a S1 interface 4522 towards RAN 4516, and routes data packets between RAN 4516 and CN 4538. In at least one embodiment, S-GW 4530 may be a local mobility anchor point for inter-RAN node handovers and also may provide an anchor for inter-3GPP mobility. In at least one embodiment, other responsibilities may include lawful intercept, charging, and some policy enforcement.

In at least one embodiment, P-GW 4534 may terminate an SGi interface toward a PDN. In at least one embodiment, P-GW 4534 may route data packets between an EPC network 4538 and external networks such as a network including application server 4540 (alternatively referred to as application function (AF)) via an Internet Protocol (IP) interface 4542. In at least one embodiment, application server 4540 may be an element offering applications that use IP bearer resources with a core network (e.g., UMTS Packet Services (PS) domain, LTE PS data services, etc.). In at least one embodiment, P-GW 4534 is shown to be communicatively coupled to an application server 4540 via an IP communications interface 4542. In at least one embodiment, application server 4540 can also be configured to support one or more communication services (e.g., Voice-over-Internet Protocol (VoIP) sessions, PTT sessions, group communication sessions, social networking services, etc.) for UEs 4502 and 4504 via CN 4538.

In at least one embodiment, P-GW 4534 may further be a node for policy enforcement and charging data collection. In at least one embodiment, policy and Charging Enforcement Function (PCRF) 4536 is a policy and charging control element of CN 4538. In at least one embodiment, in a non-roaming scenario, there may be a single PCRF in a Home Public Land Mobile Network (HPLMN) associated with a UE's Internet Protocol Connectivity Access Network (IP-CAN) session. In at least one embodiment, in a roaming scenario with local breakout of traffic, there may be two PCRFs associated with a UE's IP-CAN session: a Home PCRF (H-PCRF) within a HPLMN and a Visited PCRF (V-PCRF) within a Visited Public Land Mobile Network (VPLMN). In at least one embodiment, PCRF 4536 may be communicatively coupled to application server 4540 via P-GW 4534. In at least one embodiment, application server 4540 may signal PCRF 4536 to indicate a new service flow and select an appropriate Quality of Service (QoS) and charging parameters. In at least one embodiment, PCRF 4536 may provision this rule into a Policy and Charging Enforcement Function (PCEF) (not shown) with an appropriate traffic flow template (TFT) and QoS class of identifier (QCI), which commences a QoS and charging as specified by application server 4540.

In at least one embodiment, at least one component shown or described with respect to FIG. 45 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of RAN 4516, such as RAN node 4518 or 4520, is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of RAN 4516, such as RAN node 4518 or 4520, is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 46 illustrates example components of a device 4600 in accordance with at least one embodiment. In at least one embodiment, device 4600 may include application circuitry 4604, baseband circuitry 4608, Radio Frequency (RF) circuitry 4610, front-end module (FEM) circuitry 4602, one or more antennas 4612, and power management circuitry (PMC) 4606 coupled together at least as shown. In at least one embodiment, components of illustrated device 4600 may be included in a UE or a RAN node. In at least one embodiment, device 4600 may include less elements (e.g., a RAN node may not utilize application circuitry 4604, and instead include a processor/controller to process IP data received from an EPC). In at least one embodiment, device 4600 may include additional elements such as, for example, memory/storage, display, camera, sensor, or input/output (I/O) interface. In at least one embodiment, components described below may be included in more than one device (e.g., said circuitries may be separately included in more than one device for Cloud-RAN (C-RAN) implementations).

In at least one embodiment, application circuitry 4604 may include one or more application processors. In at least one embodiment, application circuitry 4604 may include circuitry such as, but not limited to, one or more single-core or multi-core processors. In at least one embodiment, processor(s) may include any combination of general purpose processors and dedicated processors (e.g., graphics processors, application processors, etc.). In at least one embodiment, processors may be coupled with or may include memory/storage and may be configured to execute instructions stored in memory/storage to enable various applications or operating systems to run on device 4600. In at least one embodiment, processors of application circuitry 4604 may process IP data packets received from an EPC.

In at least one embodiment, baseband circuitry 4608 may include circuitry such as, but not limited to, one or more single-core or multi-core processors. In at least one embodiment, baseband circuitry 4608 may include one or more baseband processors or control logic to process baseband signals received from a receive signal path of RF circuitry 4610 and to generate baseband signals for a transmit signal path of RF circuitry 4610. In at least one embodiment, baseband processing circuitry 4608 may interface with application circuitry 4604 for generation and processing of baseband signals and for controlling operations of RF circuitry 4610. In at least one embodiment, baseband circuitry 4608 may include a third generation (3G) baseband processor 4608A, a fourth generation (4G) baseband processor 4608B, a fifth generation (5G) baseband processor 4608C, or other baseband processor(s) 4608D for other existing generations, generations in development or to be developed (e.g., second generation (2G), sixth generation (6G), etc.). In at least one embodiment, baseband circuitry 4608 (e.g., one or more of base-band processors 4608A-D) may handle various radio control functions that enable communication with one or more radio networks via RF circuitry 4610. In at least one embodiment, some or all of a functionality of baseband processors 4608A-D may be included in modules stored in memory 4608G and executed via a Central Processing Unit (CPU) 4608E. In at least one embodiment, radio control functions may include, but are not limited to, signal modulation/demodulation, encoding/decoding, radio frequency shifting, etc. In at least one embodiment, modulation/demodulation circuitry of baseband circuitry 4608 may include Fast-Fourier Transform (FFT), precoding, or constellation mapping/demapping functionality. In at least one embodiment, encoding/decoding circuitry of baseband circuitry 4608 may include convolution, tailbiting convolution, turbo, Viterbi, or Low Density Parity Check (LDPC) encoder/decoder functionality.

In at least one embodiment, baseband circuitry 4608 may include one or more audio digital signal processor(s) (DSP) 4608F. In at least one embodiment, audio DSP(s) 4608F may be include elements for compression/decompression and echo cancellation and may include other suitable processing elements in other embodiments. In at least one embodiment, components of baseband circuitry may be suitably combined in a single chip, a single chipset, or disposed on a same circuit board in some embodiments. In at least one embodiment, some or all of constituent components of baseband circuitry 4608 and application circuitry 4604 may be implemented together such as, for example, on a system on a chip (SOC).

In at least one embodiment, baseband circuitry 4608 may provide for communication compatible with one or more radio technologies. In at least one embodiment, baseband circuitry 4608 may support communication with an evolved universal terrestrial radio access network (EUTRAN) or other wireless metropolitan area networks (WMAN), a wireless local area network (WLAN), a wireless personal area network (WPAN). In at least one embodiment, baseband circuitry 4608 is configured to support radio communications of more than one wireless protocol and may be referred to as multimode baseband circuitry.

In at least one embodiment, RF circuitry 4610 may enable communication with wireless networks using modulated electromagnetic radiation through a non-solid medium. In at least one embodiment, RF circuitry 4610 may include switches, filters, amplifiers, etc. to facilitate communication with a wireless network. In at least one embodiment, RF circuitry 4610 may include a receive signal path which may include circuitry to down-convert RF signals received from FEM circuitry 4602 and provide baseband signals to baseband circuitry 4608. In at least one embodiment, RF circuitry 4610 may also include a transmit signal path which may include circuitry to up-convert baseband signals provided by baseband circuitry 4608 and provide RF output signals to FEM circuitry 4602 for transmission.

In at least one embodiment, receive signal path of RF circuitry 4610 may include mixer circuitry 4610 a, amplifier circuitry 4610 b and filter circuitry 4610 c. In at least one embodiment, a transmit signal path of RF circuitry 4610 may include filter circuitry 4610 c and mixer circuitry 4610 a. In at least one embodiment, RF circuitry 4610 may also include synthesizer circuitry 4610 d for synthesizing a frequency for use by mixer circuitry 4610 a of a receive signal path and a transmit signal path. In at least one embodiment, mixer circuitry 4610 a of a receive signal path may be configured to down-convert RF signals received from FEM circuitry 4602 based on a synthesized frequency provided by synthesizer circuitry 4610 d. In at least one embodiment, amplifier circuitry 4610 b may be configured to amplify down-converted signals and filter circuitry 4610 c may be a low-pass filter (LPF) or band-pass filter (BPF) configured to remove unwanted signals from down-converted signals to generate output baseband signals. In at least one embodiment, output baseband signals may be provided to baseband circuitry 4608 for further processing. In at least one embodiment, output baseband signals may be zero-frequency baseband signals, although this is not a requirement. In at least one embodiment, mixer circuitry 4610 a of a receive signal path may comprise passive mixers.

In at least one embodiment, mixer circuitry 4610 a of a transmit signal path may be configured to up-convert input baseband signals based on a synthesized frequency provided by synthesizer circuitry 4610 d to generate RF output signals for FEM circuitry 4602. In at least one embodiment, baseband signals may be provided by baseband circuitry 4608 and may be filtered by filter circuitry 4610 c.

In at least one embodiment, mixer circuitry 4610 a of a receive signal path and mixer circuitry 4610 a of a transmit signal path may include two or more mixers and may be arranged for quadrature down conversion and up conversion, respectively. In at least one embodiment, mixer circuitry 4610 a of a receive signal path and mixer circuitry 4610 a of a transmit signal path may include two or more mixers and may be arranged for image rejection (e.g., Hartley image rejection). In at least one embodiment, mixer circuitry 4610 a of a receive signal path and mixer circuitry 4610 a may be arranged for direct down conversion and direct up conversion, respectively. In at least one embodiment, mixer circuitry 4610 a of a receive signal path and mixer circuitry 4610 a of a transmit signal path may be configured for super-heterodyne operation.

In at least one embodiment, output baseband signals and input baseband signals may be analog baseband signals. In at least one embodiment, output baseband signals and input baseband signals may be digital baseband signals. In at least one embodiment, RF circuitry 4610 may include analog-to-digital converter (ADC) and digital-to-analog converter (DAC) circuitry and baseband circuitry 4608 may include a digital baseband interface to communicate with RF circuitry 4610.

In at least one embodiment, a separate radio IC circuitry may be provided for processing signals for each spectrum In at least one embodiment, synthesizer circuitry 4610 d may be a fractional-N synthesizer or a fractional N/N+1 synthesizer. In at least one embodiment, synthesizer circuitry 4610 d may be a delta-sigma synthesizer, a frequency multiplier, or a synthesizer comprising a phase-locked loop with a frequency divider.

In at least one embodiment, synthesizer circuitry 4610 d may be configured to synthesize an output frequency for use by mixer circuitry 4610 a of RF circuitry 4610 based on a frequency input and a divider control input. In at least one embodiment, synthesizer circuitry 4610 d may be a fractional N/N+1 synthesizer.

In at least one embodiment, frequency input may be provided by a voltage-controlled oscillator (VCO). In at least one embodiment, divider control input may be provided by either baseband circuitry 4608 or applications processor 4604 depending on a desired output frequency. In at least one embodiment, a divider control input (e.g., N) may be determined from a look-up table based on a channel indicated by applications processor 4604.

In at least one embodiment, synthesizer circuitry 4610 d of RF circuitry 4610 may include a divider, a delay-locked loop (DLL), a multiplexer and a phase accumulator. In at least one embodiment, divider may be a dual modulus divider (DMD) and phase accumulator may be a digital phase accumulator (DPA). In at least one embodiment, DMD may be configured to divide an input signal by either N or N+1 (e.g., based on a carry out) to provide a fractional division ratio. In at least one embodiment, DLL may include a set of cascaded, tunable, delay elements, a phase detector, a charge pump and a D-type flip-flop. In at least one embodiment, delay elements may be configured to break a VCO period up into Nd equal packets of phase, where Nd is a number of delay elements in a delay line. In at least one embodiment, in this way, DLL provides negative feedback to help ensure that total delay through a delay line is one VCO cycle.

In at least one embodiment, synthesizer circuitry 4610 d may be configured to generate a carrier frequency as an output frequency, while in other embodiments, output frequency may be a multiple of a carrier frequency (e.g., twice a carrier frequency, four times a carrier frequency) and used in conjunction with quadrature generator and divider circuitry to generate multiple signals at a carrier frequency with multiple different phases with respect to each other. In at least one embodiment, output frequency may be a LO frequency (fLO). In at least one embodiment, RF circuitry 4610 may include an IQ/polar converter.

In at least one embodiment, FEM circuitry 4602 may include a receive signal path which may include circuitry configured to operate on RF signals received from one or more antennas 4612, amplify received signals and provide amplified versions of received signals to RF circuitry 4610 for further processing. In at least one embodiment, FEM circuitry 4602 may also include a transmit signal path which may include circuitry configured to amplify signals for transmission provided by RF circuitry 4610 for transmission by one or more of one or more antennas 4612. In at least one embodiment, amplification through a transmit or receive signal paths may be done solely in RF circuitry 4610, solely in FEM 4602, or in both RF circuitry 4610 and FEM 4602.

In at least one embodiment, FEM circuitry 4602 may include a TX/RX switch to switch between transmit mode and receive mode operation. In at least one embodiment, FEM circuitry may include a receive signal path and a transmit signal path. In at least one embodiment, a receive signal path of FEM circuitry may include an LNA to amplify received RF signals and provide amplified received RF signals as an output (e.g., to RF circuitry 4610). In at least one embodiment, a transmit signal path of FEM circuitry 4602 may include a power amplifier (PA) to amplify input RF signals (e.g., provided by RF circuitry 4610), and one or more filters to generate RF signals for subsequent transmission (e.g., by one or more of one or more antennas 4612).

In at least one embodiment, PMC 4606 may manage power provided to baseband circuitry 4608. In at least one embodiment, PMC 4606 may control power-source selection, voltage scaling, battery charging, or DC-to-DC conversion. In at least one embodiment, PMC 4606 may often be included when device 4600 is capable of being powered by a battery, for example, when device is included in a UE. In at least one embodiment, PMC 4606 may increase power conversion efficiency while providing desirable implementation size and heat dissipation characteristics.

In at least one embodiment, PMC 4606 may be additionally or alternatively coupled with, and perform similar power management operations for, other components such as, but not limited to, application circuitry 4604, RF circuitry 4610, or FEM 4602.

In at least one embodiment, PMC 4606 may control, or otherwise be part of, various power saving mechanisms of device 4600. In at least one embodiment, if device 4600 is in an RRC Connected state, where it is still connected to a RAN node as it expects to receive traffic shortly, then it may enter a state known as Discontinuous Reception Mode (DRX) after a period of inactivity. In at least one embodiment, during this state, device 4600 may power down for brief intervals of time and thus save power.

In at least one embodiment, if there is no data traffic activity for an extended period of time, then device 4600 may transition off to an RRC Idle state, where it disconnects from a network and does not perform operations such as channel quality feedback, handover, etc. In at least one embodiment, device 4600 goes into a very low power state and it performs paging where again it periodically wakes up to listen to a network and then powers down again. In at least one embodiment, device 4600 may not receive data in this state, in order to receive data, it must transition back to RRC Connected state.

In at least one embodiment, an additional power saving mode may allow a device to be unavailable to a network for periods longer than a paging interval (ranging from seconds to a few hours). In at least one embodiment, during this time, a device is totally unreachable to a network and may power down completely. In at least one embodiment, any data sent during this time incurs a large delay and it is assumed delay is acceptable.

In at least one embodiment, processors of application circuitry 4604 and processors of baseband circuitry 4608 may be used to execute elements of one or more instances of a protocol stack. In at least one embodiment, processors of baseband circuitry 4608, alone or in combination, may be used execute Layer 3, Layer 2, or Layer 1 functionality, while processors of application circuitry 4608 may utilize data (e.g., packet data) received from these layers and further execute Layer 4 functionality (e.g., transmission communication protocol (TCP) and user datagram protocol (UDP) layers). In at least one embodiment, layer 3 may comprise a radio resource control (RRC) layer. In at least one embodiment, Layer 2 may comprise a medium access control (MAC) layer, a radio link control (RLC) layer, and a packet data convergence protocol (PDCP) layer. In at least one embodiment, Layer 1 may comprise a physical (PHY) layer of a UE/RAN node.

In at least one embodiment, at least one component shown or described with respect to FIG. 46 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of device 4600, such as 5G baseband circuitry 4608C, is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of device 4600, such as 5G baseband circuitry 4608C, is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 47 illustrates example interfaces of baseband circuitry, in accordance with at least one embodiment. In at least one embodiment, as discussed above, baseband circuitry 4608 of FIG. 46 may comprise processors 4608A-4608E and a memory 4608G utilized by said processors. In at least one embodiment, each of processors 4608A-4608E may include a memory interface, 4702A-4702E, respectively, to send/receive data to/from memory 4608G.

In at least one embodiment, baseband circuitry 4608 may further include one or more interfaces to communicatively couple to other circuitries/devices, such as a memory interface 4704 (e.g., an interface to send/receive data to/from memory external to baseband circuitry 4608), an application circuitry interface 4706 (e.g., an interface to send/receive data to/from application circuitry 4604 of FIG. 46 ), an RF circuitry interface 4708 (e.g., an interface to send/receive data to/from RF circuitry 4610 of FIG. 46 ), a wireless hardware connectivity interface 4710 (e.g., an interface to send/receive data to/from Near Field Communication (NFC) components, Bluetooth® components (e.g., Bluetooth® Low Energy), Wi-Fi® components, and other communication components), and a power management interface 4712 (e.g., an interface to send/receive power or control signals to/from PMC 4606.

In at least one embodiment, at least one component shown or described with respect to FIG. 47 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of baseband circuitry 4708 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of baseband circuitry 4708 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 48 illustrates an example of an uplink channel, in accordance with at least one embodiment. In at least one embodiment, FIG. 48 illustrates transmitting and receiving data within a physical uplink shared channel (PUSCH) in 5G NR, which may be part of a physical layer of a mobile device network.

In at least one embodiment, Physical Uplink Shared Channel (PUSCH) in 5G NR is designated to carry multiplexed control information and user application data. In at least one embodiment, 5G NR provides much more flexibility and reliability comparing to its predecessor, which in some examples may be referred to as 4G LTE, including more elastic pilot arrangements and support for both cyclic prefix (CP)-OFDM and Discrete Fourier Transform spread (DFT-s)-OFDM waveforms. In at least one embodiment, standard introduced filtered OFDM (f-OFDM) technique is utilized to add additional filtering to reduce Out-of-Band emission and improve performance at higher modulation orders. In at least one embodiment, modifications in Forward Error Correction (FEC) were imposed to replace Turbo Codes used in 4G LTE by Quasi-Cyclic Low Density Parity Check (QC-LDPC) codes, which were proven to achieve better transmission rates and provide opportunities for more efficient hardware implementations.

In at least one embodiment, transmission of 5G NR downlink and uplink data is organized into frames of 10 ms duration, each divided into 10 subframes of 1 ms each. In at least one embodiment, subframes are composed of a variable number of slots, depending on a selected subcarrier spacing which is parameterized in 5G NR. In at least one embodiment, a slot is built from 14 OFDMA symbols, each prepended with a cyclic prefix. In at least one embodiment, a subcarrier that is located within a passband and is designated for transmission is called a Resource Element (RE). In at least one embodiment, a group of 12 neighboring RE in a same symbol form a Physical Resource Block (PRB).

In at least one embodiment, 5G NR standard defined two types of reference signals associated with transmission within a PUSCH channel. In at least one embodiment, Demodulation Reference Signal (DMRS) is a user specific reference signal with high frequency density. In at least one embodiment, DMRS is transmitted within dedicated orthogonal frequency-division multiple access (OFDMA) symbols only and designated for frequency-selective channel estimation. In at least one embodiment, a number of DMRS symbols within a slot may vary between 1 and 4 depending on configuration, where a denser DMRS symbol spacing in time is designated for fast time-varying channels to obtain more accurate estimates within a coherence time of a channel. In at least one embodiment, in a frequency domain, DMRS PRB are mapped within a whole transmission allocation. In at least one embodiment, spacing between a DMRS resource element (RE) assigned for a same Antenna Port (AP) may be chosen between 2 and 3. In at least one embodiment, in a case of 2-2 multiple-input, multiple-output (MIMO), a standard allows for orthogonal assignment of RE between AP. In at least one embodiment, a receiver may perform partial single input, multiple output (SIMO) channel estimation based on a DMRS RE prior to MIMO equalization, neglecting spatial correlation.

In at least one embodiment, a second type of reference signal is a Phase Tracking Reference Signal (PTRS). In at least one embodiment, PTRS subcarriers are arranged in a comb structure having high density in a time domain. In at least one embodiment, it is used mainly in mmWave frequency bands to track and correct phase noise, which is a considerable source of performance losses. In at least one embodiment, usage of PTRS is optional, as it may lower a total spectral efficiency of a transmission when effects of phase noise are negligible.

In at least one embodiment, for transmission of data, a transport block may be generated from a MAC layer and given to a physical layer. In at least one embodiment, a transport block may be data that is intended to be transmitted. In at least one embodiment, a transmission in a physical layer starts with grouped resource data, which may be referred to as transport blocks. In at least one embodiment, a transport block is received by a cyclic redundancy check (CRC) 4802. In at least one embodiment, a cyclic redundancy check is appended to each transport block for error detection. In at least one embodiment, a cyclic redundancy check is used for error detection in transport blocks. In at least one embodiment, an entire transport block is used to calculate CRC parity bits and these parity bits are then attached to an end of a transport block. In at least one embodiment, minimum and maximum code block sizes are specified so blocks sizes are compatible with further processes. In at least one embodiment, an input block is segmented when an input block is greater than a maximum code block size.

In at least one embodiment, a transport block is received and encoded by a low-density parity-check (LDPC) encode 4804. In at least one embodiment, NR employs low-density parity-check (LDPC) codes for a data channel and polar codes for a control channel. In at least one embodiment, LDPC codes are defined by their parity-check matrices, with each column representing a coded bit, and each row representing a parity-check equation. In at least one embodiment, LDPC codes are decoded by exchanging messages between variables and parity checks in an iterative manner. In at least one embodiment, LDPC codes proposed for NR use a quasi-cyclic structure, where a parity-check matrix is defined by a smaller base matrix. In at least one embodiment, each entry of the base matrix represents either a Z×Z zero matrix or a shifted Z×Z identity matrix

In at least one embodiment, an encoded transport block is received by rate match 4806. In at least one embodiment, an encoded block is used to create an output bit stream with a desired code rate. In at least one embodiment, rate match 4806 is utilized to create an output bit stream to be transmitted with a desired code rate. In at least one embodiment, bits are selected and pruned from a buffer to create an output bit stream with a desired code rate. In at least one embodiment, a Hybrid Automatic Repeat Request (HARQ) error correction scheme is incorporated.

In at least one embodiment, output bits are scrambled, which may aid in privacy, in scramble 4808. In at least one embodiment, codewords are bit-wise multiplied with an orthogonal sequence and a UE-specific scrambling sequence. In at least one embodiment, output of scramble 4808 may be input into modulation/mapping/precoding and other processes 4810. In at least one embodiment, various modulation, mapping, and precoding processes are performed.

In at least one embodiment, bits output from scramble 4808 are modulated with a modulation scheme, resulting in blocks of modulation symbols. In at least one embodiment, scrambled codewords undergo modulation using one of modulation schemes QPSK, 16 QAM, 64 QAM, resulting in a block of modulation symbols. In at least one embodiment, a channel interleaver process may be utilized that implements a first time mapping of modulation symbols onto a transmit waveform while ensuring that HARQ information is present on both slots. In at least one embodiment, modulation symbols are mapped to various layers based on transmit antennas. In at least one embodiment, symbols may be precoded, in which they are divided into sets, and an Inverse Fast Fourier Transform may be performed. In at least one embodiment, transport data and control multiplexing may be performed such that HARQ acknowledge (ACK) information is present in both slots and is mapped to resources around demodulation reference signals. In at least one embodiment, various precoding processes are performed.

In at least one embodiment, symbols are mapped to allocated physical resource elements in resource element mapping 4812. In at least one embodiment, allocation sizes may be limited to values whose prime factors are 2, 3 and 5. In at least one embodiment, symbols are mapped in increasing order beginning with subcarriers. In at least one embodiment, subcarrier mapped modulation symbols data are orthogonal frequency-division multiple access (OFDMA) modulated through IFFT operation in OFDMA modulation 4814. In at least one embodiment, time domain representations of each symbol are concatenated and filtered using transmit FIR filter to attenuate unwanted Out of Band emission to adjacent frequency bands caused by phase discontinuities and utilization of different numerologies. In at least one embodiment, an output of OFDMA modulation 4814 may be transmitted to be received and processed by another system.

In at least one embodiment, a transmission may be received by OFDMA demodulation 4816. In at least one embodiment, a transmission may originate from user mobile devices over a cellular network, although other contexts may be present. In at least one embodiment, a transmission may be demodulated through IFFT processing. In at least one embodiment, once OFDMA demodulation through IFFT processing has been accomplished, an estimation and correction of residual Sample Time Offset (STO) and Carrier Frequency Offset (CFO) may be performed. In at least one embodiment, both CFO and STO corrections have to be performed in frequency domain, because a received signal can be a superposition of transmissions coming from multiple UEs multiplexed in frequency, each suffering from a specific residual synchronization error. In at least one embodiment, residual CFO is estimated as a phase rotation between pilot subcarriers belonging to different OFDM symbols and corrected by a circular convolution operation in frequency domain.

In at least one embodiment, output of OFDMA demodulation 4816 may be received by resource element demapping 4818. In at least one embodiment, resource element demapping 4818 may determine symbols and demap symbols from allocated physical resource elements. In at least one embodiment, a channel estimation and equalization is performed in channel estimation 4820 in order to compensate for effects of multipath propagation. In at least one embodiment, channel estimation 4820 may be utilized to minimize effects of noise originating from various transmission layers and antennae. In at least one embodiment, channel estimation 4820 may generate equalized symbols from an output of resource element demapping 4818. In at least one embodiment, demodulation/demapping 4822 may receive equalized symbols from channel estimation 4820. In at least one embodiment, equalized symbols are demapped and permuted through a layer demapping operation. In at least one embodiment, a Maximum A Posteriori Probability (MAP) demodulation approach may be utilized to produce values representing beliefs regarding a received bit being 0 or 1, expressed in a form of Log-Likelihood Ratio (LLR).

In at least one embodiment, soft-demodulated bits are processed using various operations, including descrambling, deinterleaving and rate unmatching with LLR soft-combining using a circular buffer prior to LDPC decoding. In at least one embodiment, descramble 4824 may involve processes that reverse one or more processes of scramble 4808. In at least one embodiment, rate unmatch 4826 may involve processes that reverse one or more processes of rate match 4806. In at least one embodiment, descramble 4824 may receive output from demodulation/demapping 4822, and descramble received bits. In at least one embodiment, rate unmatch 4826 may receive descrambled bits, and utilize LLR soft-combining utilizing a circular buffer prior to LDPC decode 4828.

In at least one embodiment, decoding of LDPC codes in practical applications is done based on iterative belief propagation algorithms. In at least one embodiment, an LDPC code can be represented in a form of a bipartite graph with parity check matrix H of size M×N being a biadjacency matrix defining connections between graph nodes. In at least one embodiment, M rows of matrix H corresponds to parity check nodes, whereas N columns corresponds to variable nodes, i.e. received codeword bits. In at least one embodiment, a principle of belief propagation algorithms is based on iterative message exchange, in which A Posteriori probabilities between a variable and check nodes are updated, until a valid codeword is obtained. In at least one embodiment, LDPC decode 4828 may output a transport block comprising data.

In at least one embodiment, CRC check 4830 may determine errors and perform one or more actions based on parity bits attached to a received transport block. In at least one embodiment, CRC check 4830 may analyze and process parity bits attached to a received transport block, or otherwise any information associated with a CRC. In at least one embodiment, CRC check 4830 may transmit a processed transport block to a MAC layer for further processing.

It should be noted that, in various embodiments, transmitting and receiving data, which may be a transport block or other variation thereof, may include various processes not depicted in FIG. 48 . In at least one embodiment, processes depicted in FIG. 48 are not intended to be exhaustive and further processes such as additional modulation, mapping, multiplexing, precoding, constellation mapping/demapping, MIMO detection, detection, decoding and variations thereof may be utilized in transmitting and receiving data as part of a network.

In at least one embodiment, at least one component shown or described with respect to FIG. 48 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component shown or described with respect to FIG. 48 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component shown or described with respect to FIG. 48 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 49 illustrates an architecture of a system 4900 of a network in accordance with some embodiments. In at least one embodiment, system 4900 is shown to include a UE 4902, a 5G access node or RAN node (shown as (R)AN node 4908), a User Plane Function (shown as UPF 4904), a Data Network (DN 4906), which may be, for example, operator services, Internet access or 3rd party services, and a 5G Core Network (5GC) (shown as CN 4910).

In at least one embodiment, CN 4910 includes an Authentication Server Function (AUSF 4914); a Core Access and Mobility Management Function (AMF 4912); a Session Management Function (SMF 4918); a Network Exposure Function (NEF 4916); a Policy Control Function (PCF 4922); a Network Function (NF) Repository Function (NRF 4920); a Unified Data Management (UDM 4924); and an Application Function (AF 4926). In at least one embodiment, CN 4910 may also include other elements that are not shown, such as a Structured Data Storage network function (SDSF), an Unstructured Data Storage network function (UDSF), and variations thereof.

In at least one embodiment, UPF 4904 may act as an anchor point for intra-RAT and inter-RAT mobility, an external PDU session point of interconnect to DN 4906, and a branching point to support multi-homed PDU session. In at least one embodiment, UPF 4904 may also perform packet routing and forwarding, packet inspection, enforce user plane part of policy rules, lawfully intercept packets (UP collection); traffic usage reporting, perform QoS handling for user plane (e.g. packet filtering, gating, UL/DL rate enforcement), perform Uplink Traffic verification (e.g., SDF to QoS flow mapping), transport level packet marking in uplink and downlink, and downlink packet buffering and downlink data notification triggering. In at least one embodiment, UPF 4904 may include an uplink classifier to support routing traffic flows to a data network. In at least one embodiment, DN 4906 may represent various network operator services, Internet access, or third party services.

In at least one embodiment, AUSF 4914 may store data for authentication of UE 4902 and handle authentication related functionality. In at least one embodiment, AUSF 4914 may facilitate a common authentication framework for various access types.

In at least one embodiment, AMF 4912 may be responsible for registration management (e.g., for registering UE 4902, etc.), connection management, reachability management, mobility management, and lawful interception of AMF-related events, and access authentication and authorization. In at least one embodiment, AMF 4912 may provide transport for SM messages for SMF 4918, and act as a transparent proxy for routing SM messages. In at least one embodiment, AMF 4912 may also provide transport for short message service (SMS) messages between UE 4902 and an SMS function (SMSF) (not shown by FIG. 49 ). In at least one embodiment, AMF 4912 may act as Security Anchor Function (SEA), which may include interaction with AUSF 4914 and UE 4902 and receipt of an intermediate key that was established as a result of UE 4902 authentication process. In at least one embodiment, where USIM based authentication is used, AMF 4912 may retrieve security material from AUSF 4914. In at least one embodiment, AMF 4912 may also include a Security Context Management (SCM) function, which receives a key from SEA that it uses to derive access-network specific keys. In at least one embodiment, furthermore, AMF 4912 may be a termination point of RAN CP interface (N2 reference point), a termination point of NAS (NI) signaling, and perform NAS ciphering and integrity protection.

In at least one embodiment, AMF 4912 may also support NAS signaling with a UE 4902 over an N3 interworking-function (IWF) interface. In at least one embodiment, N3IWF may be used to provide access to untrusted entities. In at least one embodiment, N3IWF may be a termination point for N2 and N3 interfaces for control plane and user plane, respectively, and as such, may handle N2 signaling from SMF and AMF for PDU sessions and QoS, encapsulate/de-encapsulate packets for IPSec and N3 tunneling, mark N3 user-plane packets in uplink, and enforce QoS corresponding to N3 packet marking taking into account QoS requirements associated to such marking received over N2. In at least one embodiment, N3IWF may also relay uplink and downlink control-plane NAS (NI) signaling between UE 4902 and AMF 4912, and relay uplink and downlink user-plane packets between UE 4902 and UPF 4904. In at least one embodiment, N3IWF also provides mechanisms for IPsec tunnel establishment with UE 4902.

In at least one embodiment, SMF 4918 may be responsible for session management (e.g., session establishment, modify and release, including tunnel maintain between UPF and AN node); UE IP address allocation & management (including optional Authorization); Selection and control of UP function; Configures traffic steering at UPF to route traffic to proper destination; termination of interfaces towards Policy control functions; control part of policy enforcement and QoS; lawful intercept (for SM events and interface to LI System); termination of SM parts of NAS messages; downlink Data Notification; initiator of AN specific SM information, sent via AMF over N2 to AN; determine SSC mode of a session. In at least one embodiment, SMF 4918 may include following roaming functionality: handle local enforcement to apply QoS SLAB (VPLMN); charging data collection and charging interface (VPLMN); lawful intercept (in VPLMN for SM events and interface to LI System); support for interaction with external DN for transport of signaling for PDU session authorization/authentication by external DN.

In at least one embodiment, NEF 4916 may provide means for securely exposing services and capabilities provided by 3GPP network functions for third party, internal exposure/re-exposure, Application Functions (e.g., AF 4926), edge computing or fog computing systems, etc. In at least one embodiment, NEF 4916 may authenticate, authorize, and/or throttle AFs. In at least one embodiment, NEF 4916 may also translate information exchanged with AF 4926 and information exchanged with internal network functions. In at least one embodiment, NEF 4916 may translate between an AF-Service-Identifier and an internal 5GC information. In at least one embodiment, NEF 4916 may also receive information from other network functions (NFs) based on exposed capabilities of other network functions. In at least one embodiment, this information may be stored at NEF 4916 as structured data, or at a data storage NF using a standardized interfaces. In at least one embodiment, stored information can then be re-exposed by NEF 4916 to other NFs and AFs, and/or used for other purposes such as analytics.

In at least one embodiment, NRF 4920 may support service discovery functions, receive NF Discovery Requests from NF instances, and provide information of discovered NF instances to NF instances. In at least one embodiment, NRF 4920 also maintains information of available NF instances and their supported services.

In at least one embodiment, PCF 4922 may provide policy rules to control plane function(s) to enforce them, and may also support unified policy framework to govern network behavior. In at least one embodiment, PCF 4922 may also implement a front end (FE) to access subscription information relevant for policy decisions in a UDR of UDM 4924.

In at least one embodiment, UDM 4924 may handle subscription-related information to support a network entities' handling of communication sessions, and may store subscription data of UE 4902. In at least one embodiment, UDM 4924 may include two parts, an application FE and a User Data Repository (UDR). In at least one embodiment, UDM may include a UDM FE, which is in charge of processing of credentials, location management, subscription management and so on. In at least one embodiment, several different front ends may serve a same user in different transactions. In at least one embodiment, UDM-FE accesses subscription information stored in an UDR and performs authentication credential processing; user identification handling; access authorization; registration/mobility management; and subscription management. In at least one embodiment, UDR may interact with PCF 4922. In at least one embodiment, UDM 4924 may also support SMS management, wherein an SMS-FE implements a similar application logic as discussed previously.

In at least one embodiment, AF 4926 may provide application influence on traffic routing, access to a Network Capability Exposure (NCE), and interact with a policy framework for policy control. In at least one embodiment, NCE may be a mechanism that allows a 5GC and AF 4926 to provide information to each other via NEF 4916, which may be used for edge computing implementations. In at least one embodiment, network operator and third party services may be hosted close to UE 4902 access point of attachment to achieve an efficient service delivery through a reduced end-to-end latency and load on a transport network. In at least one embodiment, for edge computing implementations, 5GC may select a UPF 4904 close to UE 4902 and execute traffic steering from UPF 4904 to DN 4906 via N6 interface. In at least one embodiment, this may be based on UE subscription data, UE location, and information provided by AF 4926. In at least one embodiment, AF 4926 may influence UPF (re)selection and traffic routing. In at least one embodiment, based on operator deployment, when AF 4926 is considered to be a trusted entity, a network operator may permit AF 4926 to interact directly with relevant NFs.

In at least one embodiment, CN 4910 may include an SMSF, which may be responsible for SMS subscription checking and verification, and relaying SM messages to/from UE 4902 to/from other entities, such as an SMS-GMSC/IWMSC/SMS-router. In at least one embodiment, SMS may also interact with AMF 4912 and UDM 4924 for notification procedure that UE 4902 is available for SMS transfer (e.g., set a UE not reachable flag, and notifying UDM 4924 when UE 4902 is available for SMS).

In at least one embodiment, system 4900 may include following service-based interfaces: Namf: Service-based interface exhibited by AMF; Nsmf: Service-based interface exhibited by SMF; Nnef: Service-based interface exhibited by NEF; Npcf: Service-based interface exhibited by PCF; Nudm: Service-based interface exhibited by UDM; Naf: Service-based interface exhibited by AF; Nnrf: Service-based interface exhibited by NRF; and Nausf: Service-based interface exhibited by AUSF.

In at least one embodiment, system 4900 may include following reference points: N1: Reference point between UE and AMF; N2: Reference point between (R)AN and AMF; N3: Reference point between (R)AN and UPF; N4: Reference point between SMF and UPF; and N6: Reference point between UPF and a Data Network. In at least one embodiment, there may be many more reference points and/or service-based interfaces between a NF services in NFs, however, these interfaces and reference points have been omitted for clarity. In at least one embodiment, an NS reference point may be between a PCF and AF; an N7 reference point may be between PCF and SMF; an N11 reference point between AMF and SMF; etc. In at least one embodiment, CN 4910 may include an Nx interface, which is an inter-CN interface between MME and AMF 4912 in order to enable interworking between CN 4910 and CN 7249.

In at least one embodiment, system 4900 may include multiple RAN nodes (such as (R)AN node 4908) wherein an Xn interface is defined between two or more (R)AN node 4908 (e.g., gNBs) that connecting to 5GC 410, between a (R)AN node 4908 (e.g., gNB) connect-ing to CN 4910 and an eNB (e.g., a macro RAN node), and/or between two eNBs connecting to CN 4910.

In at least one embodiment, Xn interface may include an Xn user plane (Xn-U) interface and an Xn control plane (Xn-C) interface. In at least one embodiment, Xn-U may provide non-guar-anteed delivery of user plane PDUs and support/provide data forwarding and flow control functionality. In at least one embodiment, Xn-C may provide management and error handling functionality, functionality to manage a Xn-C interface; mobility support for UE 4902 in a connected mode (e.g., CM-CONNECTED) including functionality to manage UE mobility for connected mode between one or more (R)AN node 4908. In at least one embodiment, mobility support may include context transfer from an old (source) serving (R)AN node 4908 to new (target) serving (R)AN node 4908; and control of user plane tunnels between old (source) serving (R)AN node 4908 to new (target) serving (R)AN node 4908.

In at least one embodiment, a protocol stack of a Xn-U may include a transport network layer built on Internet Protocol (IP) transport layer, and a GTP-U layer on top of a UDP and/or IP layer(s) to carry user plane PDUs. In at least one embodiment, Xn-C protocol stack may include an application layer signaling protocol (referred to as Xn Application Protocol (Xn-AP)) and a transport network layer that is built on an SCTP layer. In at least one embodiment, SCTP layer may be on top of an IP layer. In at least one embodiment, SCTP layer provides a guaranteed delivery of application layer messages. In at least one embodiment, in a transport IP layer point-to-point transmission is used to deliver signaling PDUs. In at least one embodiment, Xn-U protocol stack and/or a Xn-C protocol stack may be same or similar to an user plane and/or control plane protocol stack(s) shown and described herein.

In at least one embodiment, at least one component shown or described with respect to FIG. 49 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of system 4900, such as RAN node 4908, is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of system 4900, such as RAN node 4908 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 50 is an illustration of a control plane protocol stack in accordance with some embodiments. In at least one embodiment, a control plane 5000 is shown as a communications protocol stack between UE 4502 (or alternatively, UE 4504), RAN 4516, and MME(s) 4528.

In at least one embodiment, PHY layer 5002 may transmit or receive information used by MAC layer 5004 over one or more air interfaces. In at least one embodiment, PHY layer 5002 may further perform link adaptation or adaptive modulation and coding (AMC), power control, cell search (e.g., for initial synchronization and handover purposes), and other measurements used by higher layers, such as an RRC layer 5010. In at least one embodiment, PHY layer 5002 may still further perform error detection on transport channels, forward error correction (FEC) coding/de-coding of transport channels, modulation/demodulation of physical channels, interleaving, rate matching, mapping onto physical channels, and Multiple Input Multiple Output (MIMO) antenna processing.

In at least one embodiment, MAC layer 5004 may perform mapping between logical channels and transport channels, multiplexing of MAC service data units (SDUs) from one or more logical channels onto transport blocks (TB) to be delivered to PHY via transport channels, de-multiplexing MAC SDUs to one or more logical channels from transport blocks (TB) delivered from PHY via transport channels, multiplexing MAC SDUs onto TBs, scheduling information reporting, error correction through hybrid automatic repeat request (HARD), and logical channel prioritization.

In at least one embodiment, RLC layer 5006 may operate in a plurality of modes of operation, including: Transparent Mode (TM), Unacknowledged Mode (UM), and Acknowledged Mode (AM). In at least one embodiment, RLC layer 5006 may execute transfer of upper layer protocol data units (PDUs), error correction through automatic repeat request (ARQ) for AM data transfers, and concatenation, segmentation and reassembly of RLC SDUs for UM and AM data transfers. In at least one embodiment, RLC layer 5006 may also execute re-segmentation of RLC data PDUs for AM data transfers, reorder RLC data PDUs for UM and AM data transfers, detect duplicate data for UM and AM data transfers, discard RLC SDUs for UM and AM data transfers, detect protocol errors for AM data transfers, and perform RLC re-establishment.

In at least one embodiment, PDCP layer 5008 may execute header compression and decompression of IP data, maintain PDCP Sequence Numbers (SNs), perform in-sequence delivery of upper layer PDUs at re-establishment of lower layers, eliminate duplicates of lower layer SDUs at re-establishment of lower layers for radio bearers mapped on RLC AM, cipher and decipher control plane data, perform integrity protection and integrity verification of control plane data, control timer-based discard of data, and perform security operations (e.g., ciphering, deciphering, integrity protection, integrity verification, etc.).

In at least one embodiment, main services and functions of a RRC layer 5010 may include broadcast of system information (e.g., included in Master Information Blocks (MIBs) or System Information Blocks (SIBs) related to a non-access stratum (NAS)), broadcast of system information related to an access stratum (AS), paging, establishment, maintenance and release of an RRC connection between an UE and E-UTRAN (e.g., RRC connection paging, RRC connection establishment, RRC connection modification, and RRC connection release), establishment, configuration, maintenance and release of point-to-point radio bearers, security functions including key management, inter radio access technology (RAT) mobility, and measurement configuration for UE measurement reporting. In at least one embodiment, said MIBs and SIBs may comprise one or more information elements (IEs), which may each comprise individual data fields or data structures.

In at least one embodiment, UE 4502 and RAN 4516 may utilize a Uu interface (e.g., an LTE-Uu interface) to exchange control plane data via a protocol stack comprising PHY layer 5002, MAC layer 5004, RLC layer 5006, PDCP layer 5008, and RRC layer 5010.

In at least one embodiment, non-access stratum (NAS) protocols (NAS protocols 5012) form a highest stratum of a control plane between UE 4502 and MME(s) 4528. In at least one embodiment, NAS protocols 5012 support mobility of UE 4502 and session management procedures to establish and maintain IP connectivity between UE 4502 and P-GW 4534.

In at least one embodiment, Si Application Protocol (S1-AP) layer (Si-AP layer 5022) may support functions of a Si interface and comprise Elementary Procedures (EPs). In at least one embodiment, an EP is a unit of interaction between RAN 4516 and CN 4528. In at least one embodiment, S1-AP layer services may comprise two groups: UE-associated services and non UE-associated services. In at least one embodiment, these services perform functions including, but not limited to: E-UTRAN Radio Access Bearer (E-RAB) management, UE capability indication, mobility, NAS signaling transport, RAN Information Management (RIM), and configuration transfer.

In at least one embodiment, Stream Control Transmission Protocol (SCTP) layer (alternatively referred to as a stream control transmission protocol/internet protocol (SCTP/IP) layer) (SCTP layer 5020) may ensure reliable delivery of signaling messages between RAN 4516 and MME(s) 4528 based, in part, on an IP protocol, supported by an IP layer 5018. In at least one embodiment, L2 layer 5016 and an L1 layer 5014 may refer to communication links (e.g., wired or wireless) used by a RAN node and MME to exchange information.

In at least one embodiment, RAN 4516 and MME(s) 4528 may utilize an S1-MME interface to exchange control plane data via a protocol stack comprising a L1 layer 5014, L2 layer 5016, IP layer 5018, SCTP layer 5020, and Si-AP layer 5022.

In at least one embodiment, at least one component shown or described with respect to FIG. 50 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of RAN 5016, such as PHY 5002 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of RAN 5016, such as PHY 5002 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 51 is an illustration of a user plane protocol stack in accordance with at least one embodiment. In at least one embodiment, a user plane 5100 is shown as a communications protocol stack between a UE 4502, RAN 4516, S-GW 4530, and P-GW 4534. In at least one embodiment, user plane 5100 may utilize a same protocol layers as control plane 5000. In at least one embodiment, for example, UE 4502 and RAN 4516 may utilize a Uu interface (e.g., an LTE-Uu interface) to exchange user plane data via a protocol stack comprising PHY layer 5002, MAC layer 5004, RLC layer 5006, PDCP layer 5008.

In at least one embodiment, General Packet Radio Service (GPRS) Tunneling Protocol for a user plane (GTP-U) layer (GTP-U layer 5104) may be used for carrying user data within a GPRS core network and between a radio access network and a core network. In at least one embodiment, user data transported can be packets in any of IPv4, IPv6, or PPP formats, for example. In at least one embodiment, UDP and IP security (UDP/IP) layer (UDP/IP layer 5102) may provide checksums for data integrity, port numbers for addressing different functions at a source and destination, and encryption and authentication on selected data flows. In at least one embodiment, RAN 4516 and S-GW 4530 may utilize an S1-U interface to exchange user plane data via a protocol stack comprising L1 layer 5014, L2 layer 5016, UDP/IP layer 5102, and GTP-U layer 5104. In at least one embodiment, S-GW 4530 and P-GW 4534 may utilize an S5/S8a interface to exchange user plane data via a protocol stack comprising L1 layer 5014, L2 layer 5016, UDP/IP layer 5102, and GTP-U layer 5104. In at least one embodiment, as discussed above with respect to FIG. 50 , NAS protocols support a mobility of UE 4502 and session management procedures to establish and maintain IP connectivity between UE 4502 and P-GW 4534.

In at least one embodiment, at least one component shown or described with respect to FIG. 51 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of RAN 5116, such as PHY 5102 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of RAN 5116, such as PHY 5102 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 52 illustrates components 5200 of a core network in accordance with at least one embodiment. In at least one embodiment, components of CN 4538 may be implemented in one physical node or separate physical nodes including components to read and execute instructions from a machine-readable or computer-readable medium (e.g., a non-transitory machine-readable storage medium). In at least one embodiment, Network Functions Virtualization (NFV) is utilized to virtualize any or all of above described network node functions via executable instructions stored in one or more computer readable storage mediums (described in further detail below). In at least one embodiment, a logical instantiation of CN 4538 may be referred to as a network slice 5202 (e.g., network slice 5202 is shown to include HSS 4532, MME(s) 4528, and S-GW 4530). In at least one embodiment, a logical instantiation of a portion of CN 4538 may be referred to as a network sub-slice 5204 (e.g., network sub-slice 5204 is shown to include P-GW 4534 and PCRF 4536).

In at least one embodiment, NFV architectures and infrastructures may be used to virtualize one or more network functions, alternatively performed by proprietary hardware, onto physical resources comprising a combination of industry-standard server hardware, storage hardware, or switches. In at least one embodiment, NFV systems can be used to execute virtual or reconfigurable implementations of one or more EPC components/functions.

In at least one embodiment, at least one component shown or described with respect to FIG. 52 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of components 5200 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of components 5200 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

FIG. 53 is a block diagram illustrating components, according to at least one embodiment, of a system 5300 to support network function virtualization (NFV). In at least one embodiment, system 5300 is illustrated as including a virtualized infrastructure manager (shown as VIM 5302), a network function virtualization infrastructure (shown as NFVI 5304), a VNF manager (shown as VNFM 5306), virtualized network functions (shown as VNF 5308), an element manager (shown as EM 5310), an NFV Orchestrator (shown as NFVO 5312), and a network manager (shown as NM 5314).

In at least one embodiment, VIM 5302 manages resources of NFVI 5304. In at least one embodiment, NFVI 5304 can include physical or virtual resources and applications (including hypervisors) used to execute system 5300. In at least one embodiment, VIM 5302 may manage a life cycle of virtual resources with NFVI 5304 (e.g., creation, maintenance, and tear down of virtual machines (VMs) associated with one or more physical resources), track VM instances, track performance, fault and security of VM instances and associated physical resources, and expose VM instances and associated physical resources to other management systems.

In at least one embodiment, VNFM 5306 may manage VNF 5308. In at least one embodiment, VNF 5308 may be used to execute EPC components/functions. In at least one embodiment, VNFM 5306 may manage a life cycle of VNF 5308 and track performance, fault and security of virtual aspects of VNF 5308. In at least one embodiment, EM 5310 may track performance, fault and security of functional aspects of VNF 5308. In at least one embodiment, tracking data from VNFM 5306 and EM 5310 may comprise, for example, performance measurement (PM) data used by VIM 5302 or NFVI 5304. In at least one embodiment, both VNFM 5306 and EM 5310 can scale up/down a quantity of VNFs of system 5300.

In at least one embodiment, NFVO 5312 may coordinate, authorize, release and engage resources of NFVI 5304 in order to provide a requested service (e.g., to execute an EPC function, component, or slice). In at least one embodiment, NM 5314 may provide a package of end-user functions with responsibility for a management of a network, which may include network elements with VNFs, non-virtualized network functions, or both (management of the VNFs may occur via the EM 5310).

In at least one embodiment, at least one component shown or described with respect to FIG. 53 is utilized to implement techniques and/or functions described in connection with FIGS. 1-13 . In at least one embodiment, at least one component of system 5300 is used to perform rate matching. In at least one embodiment, rate matching includes causing 5G new radio signal information to be selected in parallel using parameters based at least in part on a 5G standard. In at least one embodiment, at least one component of system 5300 is used to perform at least one aspect described with respect to rate matching 114, example process 300, data flow 400, example process 500, example process 600, example process 900, diagram 1100, example process 1200, example process 1300, algorithm one described at least in connection with step 1314 of example process 1300, algorithm two described at least in connection with step 1316 of example process 1300, and/or algorithm three described at least in connection with step 1320 of example process 1300.

At least one embodiment of the disclosure can be described in view of the following clauses:

Clause 1. A processor comprising: one or more circuits to cause fifth generation (5G) new radio signal information to be selected in parallel.

Clause 2. The processor of clause 1, wherein the 5G new radio signal information comprises data values from a sequence used to perform rate matching for one or more low-density parity-check codes.

Clause 3. The processor of clause 1 or 2, wherein the 5G new radio signal information is caused to be selected by multiple threads, each thread of the multiple threads to select a respective subset of a set of data values from a sequence.

Clause 4. The processor of any of clause 1-3, wherein the 5G new radio signal information is selected based at least in part on available data transmission resources.

Clause 5. The processor of any of clause 1-4, wherein a spectrum for the 5G new radio signal information is shared with a fourth generation (4G) radio signal.

Clause 6. The processor of any of clause 1-5, wherein the one or more circuits are to cause the 5G radio signal information to be selected in parallel using a plurality of parallel threads.

Clause 7. The processor of any of clause 1-6, wherein the one or more circuits are to cause the 5G radio signal information to be selected in parallel using a plurality of threads where each thread of the plurality of threads selects a respective bit from a sequence used in rate matching.

Clause 8. The processor of any of clause 1-7, wherein the processor is a graphics processing unit.

Clause 9. The processor of any of clause 1-8, wherein the one or more circuits are to select an algorithm to select the 5G new radio information based, at least in part, on a sequence of null positions in a vector.

Clause 10. The processor of any of clause 1-9, wherein the one or more circuits are to cause the 5G new radio information to be selected in parallel by launching a plurality of threads, where each thread of the plurality of threads is to select a bit from a sequence independently of any previously selected bit in the sequence.

Clause 11. The processor of any of clause 1-11, wherein the one or more circuits are to select an algorithm to select the 5G new radio information based, at least in part, on an low-density parity-check parameter and an incremental redundancy version index.

Clause 12. A system, comprising: one or more processors to cause fifth generation (5G) new radio signal information to be selected in parallel.

Clause 13. The system of clause 12, wherein the one or more processors cause the 5G new radio signal information to be selected using a rate matching algorithm.

Clause 14. The system of clause 12 or 13, wherein the one or more processors cause the 5G new radio signal information to be selected using an initial index.

Clause 15. The system of any of clause 12-14, wherein the one or more processors cause the 5G new radio signal information to be selected, based at least in part on determining that an initial index indicates a location within the 5G new radio signal information that is before a contiguous set of null values in the 5G new radio signal information.

Clause 16. The system of any of clause 12-15, wherein the one or more processors cause the 5G new radio signal information to be selected, based at least in part on determining that an initial index indicates a location within the 5G new radio signal information that is after a contiguous set of null values in the 5G new radio signal information.

Clause 17. The system of any of clause 12-16, wherein the one or more processors cause the 5G new radio signal information to be selected, based at least in part on determining that an initial index indicates a location within the 5G new radio signal information that is within a contiguous set of null values in the 5G new radio signal information.

Clause 18. The system of any of clause 12-17, wherein the 5G new radio information is selected from a single code block based at least in part on a maximum code block size associated with the 5G new radio information.

Clause 19. The system of any of clause 12-18, wherein the 5G new radio information is selected from a plurality of code blocks based at least in part on a maximum code block size associated with the 5G new radio information.

Clause 20. The system of any of clause 12-19, wherein the 5G new radio information is selected from a circular buffer.

Clause 21. A machine-readable medium having stored thereon a set of instructions, which if performed by one or more processors, cause the one or more processors to at least:

cause fifth generation (5G) new radio signal information to be selected in parallel.

Clause 22. The machine-readable medium of clause 21, wherein the 5G new radio signal information comprises bits from a sequence used to perform rate matching for one or more low-density parity-check codes.

Clause 23. The machine-readable medium of clause 21 or 22, wherein the set of instructions, if executed, further cause the one or more processors to at least:

cause the 5G new radio signal information to be selected using a rate matching algorithm.

Clause 24. The machine-readable medium of any of clause 21-23, wherein the set of instructions, if executed, further cause the one or more processors to at least:

select an algorithm to select the 5G new radio information based, at least in part, on an low-density parity-check parameter and an incremental redundancy version index.

Clause 25. The machine-readable medium of any of clause 21-24, wherein the set of instructions, if executed, further cause the one or more processors to at least:

cause the 5G new radio signal information to be selected in parallel using a plurality of threads.

Clause 26. The machine-readable medium of any of clause 21-25, wherein the set of instructions, if executed, further cause the one or more processors to at least:

determine a number of data elements in the 5G new radio signal; and

cause the 5G new radio signal information to be selected in parallel using a number of threads that is equal to the number of data elements.

Clause 27. The machine-readable medium of any of clause 21-26, wherein the set of instructions, if executed, further cause the one or more processors to at least:

determine a number of data elements in the 5G new radio signal; and

cause the 5G new radio signal information to be selected in parallel using a number of threads that is less than the number of data elements.

Clause 28. The machine-readable medium of any of clause 21-27, wherein the set of instructions, if executed, further cause the one or more processors to at least:

determine a number of data elements in the 5G new radio signal; and

cause the 5G new radio signal information to be selected in parallel using a number of threads that is greater than the number of data elements.

Clause 29. A method, comprising:

using a parallel processor to cause fifth generation (5G) new radio signal information to be selected in parallel.

Clause 30. The method of clause 29, wherein the 5G new radio signal information comprises bits from a sequence used to perform rate matching for one or more low-density parity-check codes.

Clause 31. The method of clause 29 or 30, wherein the 5G new radio signal information is caused to be selected by multiple threads, each thread of the multiple threads to select a respective subset of a set of bits from a sequence.

Clause 32. The method of any of clause 29-31, wherein the 5G new radio signal information is selected based at least in part on available data transmission resources.

Clause 33. The method of any of clause 29-32, wherein a spectrum for the 5G new radio signal information is shared with a fourth generation (4G) radio signal.

Other variations are within spirit of present disclosure. Thus, while disclosed techniques are susceptible to various modifications and alternative constructions, certain illustrated embodiments thereof are shown in drawings and have been described above in detail. It should be understood, however, that there is no intention to limit disclosure to specific form or forms disclosed, but on contrary, intention is to cover all modifications, alternative constructions, and equivalents falling within spirit and scope of disclosure, as defined in appended claims.

Use of terms “a” and “an” and “the” and similar referents in context of describing disclosed embodiments (especially in context of following claims) are to be construed to cover both singular and plural, unless otherwise indicated herein or clearly contradicted by context, and not as a definition of a term. Terms “comprising,” “having,” “including,” and “containing” are to be construed as open-ended terms (meaning “including, but not limited to,”) unless otherwise noted. term “connected,” when unmodified and referring to physical connections, is to be construed as partly or wholly contained within, attached to, or joined together, even if there is something intervening. Recitation of ranges of values herein are merely intended to serve as a shorthand method of referring individually to each separate value falling within range, unless otherwise indicated herein and each separate value is incorporated into specification as if it were individually recited herein. In at least one embodiment, use of term “set” (e.g., “a set of items”) or “subset” unless otherwise noted or contradicted by context, is to be construed as a nonempty collection comprising one or more members. Further, unless otherwise noted or contradicted by context, term “subset” of a corresponding set does not necessarily denote a proper subset of corresponding set, but subset and corresponding set may be equal.

Conjunctive language, such as phrases of form “at least one of A, B, and C,” or “at least one of A, B and C,” unless specifically stated otherwise or otherwise clearly contradicted by context, is otherwise understood with context as used in general to present that an item, term, etc., may be either A or B or C, or any nonempty subset of set of A and B and C. For instance, in illustrative example of a set having three members, conjunctive phrases “at least one of A, B, and C” and “at least one of A, B and C” refer to any of following sets: {A}, {B}, {C}, {A, B}, {A, C}, {B, C}, {A, B, C}. Thus, such conjunctive language is not generally intended to imply that certain embodiments require at least one of A, at least one of B and at least one of C each to be present. In addition, unless otherwise noted or contradicted by context, term “plurality” indicates a state of being plural (e.g., “a plurality of items” indicates multiple items). In at least one embodiment, number of items in a plurality is at least two, but can be more when so indicated either explicitly or by context. Further, unless stated otherwise or otherwise clear from context, phrase “based on” means “based at least in part on” and not “based solely on.”

Operations of processes described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. In at least one embodiment, a process such as those processes described herein (or variations and/or combinations thereof) is performed under control of one or more computer systems configured with executable instructions and is implemented as code (e.g., executable instructions, one or more computer programs or one or more applications) executing collectively on one or more processors, by hardware or combinations thereof. In at least one embodiment, code is stored on a computer-readable storage medium, for example, in form of a computer program comprising a plurality of instructions executable by one or more processors. In at least one embodiment, a computer-readable storage medium is a non-transitory computer-readable storage medium that excludes transitory signals (e.g., a propagating transient electric or electromagnetic transmission) but includes non-transitory data storage circuitry (e.g., buffers, cache, and queues) within transceivers of transitory signals. In at least one embodiment, code (e.g., executable code or source code) is stored on a set of one or more non-transitory computer-readable storage media having stored thereon executable instructions (or other memory to store executable instructions) that, when executed (i.e., as a result of being executed) by one or more processors of a computer system, cause computer system to perform operations described herein. A set of non-transitory computer-readable storage media, in at least one embodiment, comprises multiple non-transitory computer-readable storage media and one or more of individual non-transitory storage media of multiple non-transitory computer-readable storage media lack all of code while multiple non-transitory computer-readable storage media collectively store all of code. In at least one embodiment, executable instructions are executed such that different instructions are executed by different processors for example, a non-transitory computer-readable storage medium store instructions and a main central processing unit (“CPU”) executes some of instructions while a graphics processing unit (“GPU”) executes other instructions. In at least one embodiment, different components of a computer system have separate processors and different processors execute different subsets of instructions.

Accordingly, in at least one embodiment, computer systems are configured to implement one or more services that singly or collectively perform operations of processes described herein and such computer systems are configured with applicable hardware and/or software that enable performance of operations. Further, a computer system that implements at least one embodiment of present disclosure is a single device and, in another embodiment, is a distributed computer system comprising multiple devices that operate differently such that distributed computer system performs operations described herein and such that a single device does not perform all operations.

Use of any and all examples, or exemplary language (e.g., “such as”) provided herein, is intended merely to better illuminate embodiments of disclosure and does not pose a limitation on scope of disclosure unless otherwise claimed. No language in specification should be construed as indicating any non-claimed element as essential to practice of disclosure.

All references, including publications, patent applications, and patents, cited herein are hereby incorporated by reference to same extent as if each reference were individually and specifically indicated to be incorporated by reference and were set forth in its entirety herein.

In description and claims, terms “coupled” and “connected,” along with their derivatives, may be used. It should be understood that these terms may be not intended as synonyms for each other. Rather, in particular examples, “connected” or “coupled” may be used to indicate that two or more elements are in direct or indirect physical or electrical contact with each other. “Coupled” may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other.

Unless specifically stated otherwise, it may be appreciated that throughout specification terms such as “processing,” “computing,” “calculating,” “determining,” or like, refer to action and/or processes of a computer or computing system, or similar electronic computing device, that manipulate and/or transform data represented as physical, such as electronic, quantities within computing system's registers and/or memories into other data similarly represented as physical quantities within computing system's memories, registers or other such information storage, transmission or display devices.

In a similar manner, term “processor” may refer to any device or portion of a device that processes electronic data from registers and/or memory and transform that electronic data into other electronic data that may be stored in registers and/or memory. As non-limiting examples, “processor” may be a CPU or a GPU. A “computing platform” may comprise one or more processors. As used herein, “software” processes may include, for example, software and/or hardware entities that perform work over time, such as tasks, threads, and intelligent agents. Also, each process may refer to multiple processes, for carrying out instructions in sequence or in parallel, continuously or intermittently. Terms “system” and “method” are used herein interchangeably insofar as system may embody one or more methods and methods may be considered a system.

In at least one embodiment, an arithmetic logic unit is a set of combinational logic circuitry that takes one or more inputs to produce a result. In at least one embodiment, an arithmetic logic unit is used by a processor to implement mathematical operation such as addition, subtraction, or multiplication. In at least one embodiment, an arithmetic logic unit is used to implement logical operations such as logical AND/OR or XOR. In at least one embodiment, an arithmetic logic unit is stateless, and made from physical switching components such as semiconductor transistors arranged to form logical gates. In at least one embodiment, an arithmetic logic unit may operate internally as a stateful logic circuit with an associated clock. In at least one embodiment, an arithmetic logic unit may be constructed as an asynchronous logic circuit with an internal state not maintained in an associated register set. In at least one embodiment, an arithmetic logic unit is used by a processor to combine operands stored in one or more registers of the processor and produce an output that can be stored by the processor in another register or a memory location.

In at least one embodiment, as a result of processing an instruction retrieved by the processor, the processor presents one or more inputs or operands to an arithmetic logic unit, causing the arithmetic logic unit to produce a result based at least in part on an instruction code provided to inputs of the arithmetic logic unit. In at least one embodiment, the instruction codes provided by the processor to the ALU are based at least in part on the instruction executed by the processor. In at least one embodiment combinational logic in the ALU processes the inputs and produces an output which is placed on a bus within the processor. In at least one embodiment, the processor selects a destination register, memory location, output device, or output storage location on the output bus so that clocking the processor causes the results produced by the ALU to be sent to the desired location.

In the scope of this application, the term arithmetic logic unit, or ALU, is used to refer to any computational logic circuit that processes operands to produce a result. For example, in the present document, the term ALU can refer to a floating point unit, a DSP, a tensor core, a shader core, a coprocessor, or a CPU.

In present document, references may be made to obtaining, acquiring, receiving, or inputting analog or digital data into a subsystem, computer system, or computer-implemented machine. A process of obtaining, acquiring, receiving, or inputting analog and digital data can be accomplished in a variety of ways such as by receiving data as a parameter of a function call or a call to an application programming interface. In some implementations, process of obtaining, acquiring, receiving, or inputting analog or digital data can be accomplished by transferring data via a serial or parallel interface. In another implementation, process of obtaining, acquiring, receiving, or inputting analog or digital data can be accomplished by transferring data via a computer network from providing entity to acquiring entity. References may also be made to providing, outputting, transmitting, sending, or presenting analog or digital data. In various examples, process of providing, outputting, transmitting, sending, or presenting analog or digital data can be accomplished by transferring data as an input or output parameter of a function call, a parameter of an application programming interface or interprocess communication mechanism.

Although discussion above sets forth example implementations of described techniques, other architectures may be used to implement described functionality, and are intended to be within scope of this disclosure. Furthermore, although specific distributions of responsibilities are defined above for purposes of discussion, various functions and responsibilities might be distributed and divided in different ways, depending on circumstances.

Furthermore, although subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that subject matter claimed in appended claims is not necessarily limited to specific features or acts described. Rather, specific features and acts are disclosed as exemplary forms of implementing the claims. 

What is claimed is:
 1. A processor comprising: one or more circuits to cause fifth generation (5G) new radio signal information to be selected in parallel.
 2. The processor of claim 1, wherein the 5G new radio signal information comprises data values from a sequence used to perform rate matching for one or more low-density parity-check codes.
 3. The processor of claim 1, wherein the 5G new radio signal information is caused to be selected by multiple threads, each thread of the multiple threads to select a respective subset of a set of data values from a sequence.
 4. The processor of claim 1, wherein the 5G new radio signal information is selected based at least in part on available data transmission resources.
 5. The processor of claim 1, wherein a spectrum for the 5G new radio signal information is shared with a fourth generation (4G) radio signal.
 6. The processor of claim 1, wherein the one or more circuits are to cause the 5G radio signal information to be selected in parallel using a plurality of parallel threads.
 7. The processor of claim 1, wherein the one or more circuits are to cause the 5G radio signal information to be selected in parallel using a plurality of threads where each thread of the plurality of threads selects a respective bit from a sequence used in rate matching.
 8. The processor of claim 1, wherein the processor is a graphics processing unit.
 9. The processor of claim 1, wherein the one or more circuits are to select an algorithm to select the 5G new radio information based, at least in part, on a sequence of null positions in a vector.
 10. The processor of claim 1, wherein the one or more circuits are to cause the 5G new radio information to be selected in parallel by launching a plurality of threads, where each thread of the plurality of threads is to select a bit from a sequence independently of any previously selected bit in the sequence.
 11. The processor of claim 1, wherein the one or more circuits are to select an algorithm to select the 5G new radio information based, at least in part, on an low-density parity-check parameter and an incremental redundancy version index.
 12. A system, comprising: one or more processors to cause fifth generation (5G) new radio signal information to be selected in parallel.
 13. The system of claim 12, wherein the one or more processors cause the 5G new radio signal information to be selected using a rate matching algorithm.
 14. The system of claim 12, wherein the one or more processors cause the 5G new radio signal information to be selected using an initial index.
 15. The system of claim 12, wherein the one or more processors cause the 5G new radio signal information to be selected, based at least in part on determining that an initial index indicates a location within the 5G new radio signal information that is before a contiguous set of null values in the 5G new radio signal information.
 16. The system of claim 12, wherein the one or more processors cause the 5G new radio signal information to be selected, based at least in part on determining that an initial index indicates a location within the 5G new radio signal information that is after a contiguous set of null values in the 5G new radio signal information.
 17. The system of claim 12, wherein the one or more processors cause the 5G new radio signal information to be selected, based at least in part on determining that an initial index indicates a location within the 5G new radio signal information that is within a contiguous set of null values in the 5G new radio signal information.
 18. The system of claim 12, wherein the 5G new radio information is selected from a single code block based at least in part on a maximum code block size associated with the 5G new radio information.
 19. The system of claim 12, wherein the 5G new radio information is selected from a plurality of code blocks based at least in part on a maximum code block size associated with the 5G new radio information.
 20. The system of claim 12, wherein the 5G new radio information is selected from a circular buffer.
 21. A machine-readable medium having stored thereon a set of instructions, which if performed by one or more processors, cause the one or more processors to at least: cause fifth generation (5G) new radio signal information to be selected in parallel.
 22. The machine-readable medium of claim 21, wherein the 5G new radio signal information comprises bits from a sequence used to perform rate matching for one or more low-density parity-check codes.
 23. The machine-readable medium of claim 21, wherein the set of instructions, if executed, further cause the one or more processors to at least: cause the 5G new radio signal information to be selected using a rate matching algorithm.
 24. The machine-readable medium of claim 21, wherein the set of instructions, if executed, further cause the one or more processors to at least: select an algorithm to select the 5G new radio information based, at least in part, on an low-density parity-check parameter and an incremental redundancy version index.
 25. The machine-readable medium of claim 21, wherein the set of instructions, if executed, further cause the one or more processors to at least: cause the 5G new radio signal information to be selected in parallel using a plurality of threads.
 26. The machine-readable medium of claim 21, wherein the set of instructions, if executed, further cause the one or more processors to at least: determine a number of data elements in the 5G new radio signal; and cause the 5G new radio signal information to be selected in parallel using a number of threads that is equal to the number of data elements.
 27. The machine-readable medium of claim 21, wherein the set of instructions, if executed, further cause the one or more processors to at least: determine a number of data elements in the 5G new radio signal; and cause the 5G new radio signal information to be selected in parallel using a number of threads that is less than the number of data elements.
 28. The machine-readable medium of claim 21, wherein the set of instructions, if executed, further cause the one or more processors to at least: determine a number of data elements in the 5G new radio signal; and cause the 5G new radio signal information to be selected in parallel using a number of threads that is greater than the number of data elements.
 29. A method, comprising: using a parallel processor to cause fifth generation (5G) new radio signal information to be selected in parallel.
 30. The method of claim 29, wherein the 5G new radio signal information comprises bits from a sequence used to perform rate matching for one or more low-density parity-check codes.
 31. The method of claim 29, wherein the 5G new radio signal information is caused to be selected by multiple threads, each thread of the multiple threads to select a respective subset of a set of bits from a sequence.
 32. The method of claim 29, wherein the 5G new radio signal information is selected based at least in part on available data transmission resources.
 33. The method of claim 29, wherein a spectrum for the 5G new radio signal information is shared with a fourth generation (4G) radio signal. 